#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10;
int n,a[N];
priority_queue<int>q;
priority_queue<int,vector<int> , greater<int> >q2;
signed main(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    sort(a+1,a+1+n);
    int sum=0;
    for(int i=1;i<=n;i++){
        int x=a[i];sum+=x;
        x=min(x,i);q.push(x);q2.push(x-i);
        while(q.top()>q2.top()+i){
            int x=q.top(),y=q2.top()+i;
            q.pop(),q2.pop();
            q.push(y),q2.push(x-i);
        }
    }
    while(q.size())sum-=q.top(),q.pop();cout<<sum;
    return 0;
}