#include <bits/stdc++.h>

#include <unistd.h>

using namespace std;

int func(vector<int> &height){

int n = height.size();

sort(height.begin(),height.end(),less<int>());

int lastMax = height[n-1];

int lastMin = height[0];

int sum =? lastMax - lastMin;

int curMinIndex = 1,curMaxIndex = n - 2;

/*每次從數(shù)組中選取最大最小元素和新序列中最大最小元素交錯(cuò)做差*/

while(curMinIndex < curMaxIndex){

sum += lastMax - height[curMinIndex];

sum += height[curMaxIndex] - lastMin;

lastMin = height[curMinIndex];

lastMax = height[curMaxIndex];

++curMinIndex;

--curMaxIndex;

}

/*如果有奇數(shù)個(gè)元素，最后curMinIndex = curMaxIndex*/

if(curMinIndex == curMaxIndex){

sum = max(sum + abs(height[curMinIndex] - lastMin),sum + abs(height[curMaxIndex] - lastMax));

}

return? sum;

}

int main(){

int n;

while(cin >> n){

vector<int> height(n);

for(auto i = 0;i < n;++i)

cin>>height[i];

cout<<func(height)<<endl;

}

? ? return 0;

}