/*
TASK:ots
LANG:C++
*/
#define MAXN 1000000

#include <iostream>

using namespace std;

int a[MAXN+1];
int b[MAXN+1];
int n;

int main()
{
    int min;
    
    scanf("%d", &n);
    
    for (int i=0; i<n; i++)
        scanf("%d", &a[i]);
    
    sort(a,a+n);
    
    min=a[1]-a[0];
    min+=a[n-1];
    min-=a[n-2];
    cout << min << endl;
    
    n-=2;
    for (int i=2; i<n; i++)
        {
             int x=a[i]-a[i-1];
             int y=a[i+1]-a[i];
             cout << x << " " << y << " " << min << endl;
             
             if (x<y) { min+=x; b[i]++; b[i-1]++; }
                else { min+=y; b[i]++; b[i+1]++; i++; }
             cout << min << endl;
        }
    
    for (int i=2; i<n; i++)
        while ((b[i]>1)&&(b[i+1]>1))
              { b[i]--; b[i+1]--; min-=(a[i+1]-a[i]); }
    
    printf("%d\n", min);
    
return 0;
}
