#include<bits/stdc++.h>
#define endl enjoy_codeforces
using lint=long long;
void cmn(lint&x,lint y){if(x>y)x=y;}
int main(){
    std::cin.tie(nullptr);std::ios_base::sync_with_stdio(false);
    lint n;std::cin>>n;
    std::vector<lint>a(n);
    for(lint&x:a)std::cin>>x;
    std::sort(a.begin(),a.end());
    if(a.front()==a.back()){
        std::cout<<1<<'\n';
        return 0;
    }
    std::vector<lint>b(n+1);
    std::partial_sum(a.begin(),a.end(),b.begin()+1);
    lint ans=std::numeric_limits<lint>::max();
    for(lint c=1;c<n;c++){
        lint l=c/2,r=c+(n-c)/2;
        cmn(ans,(2*l-c-0)*a.at(l)+(2*r-n-c)*a.at(r)
            +b.at(0)-2*b.at(l)+2*b.at(c)-2*b.at(r)+b.at(n));
    }
    std::cout<<ans<<'\n';
}