#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
#include<queue>
using namespace std;
typedef long long int lint;
int main() {
	int N;
	cin >> N;
	vector<int>vec(N);
	for (int ia = 0; ia < N; ia++) {
		cin >> vec.at(ia);
	}
	sort(vec.begin(), vec.end());
	int ans = 0;
	for (int ib = 0; ib < N; ib++) {
		ans += abs(vec.at(ib) - ib - 1);
	}
	cout << ans << endl;
}