#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define out(a) cout << a << endl
#define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)

int main() {
    int n;
    cin >> n;
    map<int, int> mp;
    vector<int> v;
    rep(i, n) {
        int a;
        cin >> a;
        if (a <= n && mp[a] == 0) mp[a] = 1;
        else v.eb(a);
    }
    sort(all(v));
    int now = 0;
    int sum = 0;
    rep3(i, 1, n + 1) {
        if (mp[i] == 1) continue;
        sum += abs(i - v[now++]);
    }
    out(sum);
}