#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;
using ll = long long;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        v[i] = a;
    }
    sort(v.begin(), v.end());

    int ans = 0;
    for (int i = 0; i < n; i++) {
        if (v[i] != (i + 1)) {
            ans += abs(i + 1 - v[i]);
        }
    }

    cout << ans << endl;

    return 0;
}