#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
    ll n;
    std::cin >> n;
    vector<ll> y(n);
    for (int i = 0; i < n; i++) {
        std::cin >> y[i];
    }
    sort(y.begin(),y.end());
    
    if(y[0] == y[n-1]){
        std::cout << 1 << std::endl;
        return 0;
    }

    vector<ll> sum(n+1);
    for (int i = 0; i < n; i++) {
        sum[i+1] = sum[i]+y[i]; 
    }
    
    ll result = 1e15;
    
    for (int i = 0; i < n-1; i++) {
        ll d,u,ijou,dv,uv;
        d = floor(sum[i+1]*1.0/(i+1));
        u = floor((sum[n]-sum[i+1])*1.0/(n-i-1));
        // std::cout << sum[i+1]*1.0<<" "<< (sum[n]-sum[i+1])<< std::endl;

        ll mind = 1e15;
        ll minu = 1e15;
        
        for (int j = -1; j <= 1; j++) {
            ll nowd = d+j;
            ll nowu = u+j;
            ijou = distance(y.begin(),lower_bound(y.begin(),y.end(),nowd));
            dv = nowd*ijou-sum[ijou]+(sum[i+1]-sum[ijou])-nowd*(i+1-ijou);
            
            ijou = distance(y.begin(),lower_bound(y.begin(),y.end(),nowu));
            uv = nowu*(ijou-i-1)-(sum[ijou]-sum[i+1])+(sum[n]-sum[ijou])-nowu*(n-ijou);
            
            mind = min(mind,dv);
            minu = min(minu,uv);
        }
        
        // std::cout << d<<" "<<dv<<" "<<u<<" "<<uv << std::endl;
        result = min(mind+minu,result);
    }
    // 70 6
    // 11.6666
    std::cout << result << std::endl;
}