#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <utility>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <cmath>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define itrep(i,x) for(auto i=(x).begin(); i!=(x).end();i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vec vector
#define INF (int)1e9
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
#define PI 3.1415926535
typedef long long int ll;
typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};

using namespace std;

int main(){
    int n; cin>>n;
    vector<int> v(n,0),vv(n);
    rep(i,0,n){
        cin>>vv[i];
        v[vv[i]-1]++;
    }
    Sort(vv);
    queue<int> q;
    rep(i,0,n){
        while(vv[i]==vv[i+1]){
            i++;
            q.push(vv[i]);
        }
    }

    int ans=0;
    rep(i,0,n){
        if(v[i]==0){
            int x=q.front();
            q.pop();
            ans+=abs(i+1-x);
        }
    }
    cout<<ans<<endl;

    
    
    return 0;
}