#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <random>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
const int inf = (1 << 30) - 1;
const ll INF = 1LL << 60;
//const int MOD = 1000000007;
const int MOD = 998244353;


int main() {
	int n;
	cin >> n;

	ll ans = 0;
	vi a;
	for (int i = 0; i < n; i++) {
		int b;
		cin >> b;

		if (b > n) {
			a.push_back(b);
		}
	}
	sort(a.begin(), a.end());

	for (int i = a.size() - 1; i >= 0; i--) {
		if (i < a.size() - 1) {
			ans += max(1, a[i] - n - i - 1);
		}
		else {
			ans += a[i] - n - i;
		}
	}
	cout << ans << endl;

	return 0;
}