#include<bits/stdc++.h>
using namespace std;
#define int long long
void Solve(){   
    int n;
    cin>>n;
    vector<int> a(n+1),s(n+1),f(n+1);
    a[0]=1;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    sort(a.begin()+1,a.end());
    for(int i=1;i<=n;i++)
        s[i]=s[i-1]+a[i];
    int m=min(n,a[n]),ans=1e18;
    int s1=0;
    for(int i=1;i<=n;i++)f[i]=1e18; 
    a.push_back(a[n]);
    for(int i=1;i<=m;i++){
        int l,r;
        if(a[i-1]>=i||a[i]==a[i-1])l=r=i;
        else l=a[i-1],r=min(a[i],i);
        for(int j=r;j>=l;j--)
            f[j]=min(f[j],f[j-1]+abs(j-a[i]));
        for(int j=1;j<=n;j++){
            cout<<f[j]<<" ";
        }
        cout<<endl;
        for(int j=l;j<=r;j++){
            int res=f[j]; 
            int k=lower_bound(a.begin()+i+1,a.end(),j+1)-a.begin();
            
            res+=(s[n]-s[k-1])-(n-k+1)*(j+1);
            //if(i==5)cout<<k<<" "<<f[j]<<" "<<res<<endl;
            // cout<<"res="<<res<<endl;
            if(res==0)cout<<i<<endl;
            if(i==5)cout<<k<<" "<<f[j]<<" "<<res<<endl;
            ans=min(ans,res);
        }
    }   
    cout<<ans<<"\n";
}
signed main(){
    ios::sync_with_stdio(false),cin.tie(0);
    Solve();
    return 0;
}