#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size())
#define ll long long 
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a)) 
using namespace std;
const int N = 1 << 20;
int n;
int a[N];
priority_queue < int > ql;
priority_queue < int, vi, greater < int > > qr;
vi xl;
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	L(i, 1, n) {
		cin >> a[i];
	}
	sort(a + 1, a + n + 1);
	ll all = 0;
	ll addr = 0;
	vi xl;
	L(i, 1, n) {
		if(a[i] > i) {
			all += a[i] - i;
			a[i] = i;
		}
		all += a[i];
		ql.push(a[i]), qr.push(a[i] - addr);
		while(ql.top() > qr.top() + addr) {
			ll x = ql.top(), y = qr.top() + addr;
			ql.pop(), qr.pop();
			ql.push(y), qr.push(x - addr);
		}
		addr += 1;
	}
	while(!ql.empty()) {
		all -= ql.top(), ql.pop();
	}
	cout << all << '\n';
	return 0;
}
/*
6
1 1 1 1 1 1

6
1 1 1 3 3 3 

6
4 6 8 9 2 4
*/