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

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(ll i=n;i<N;i++)
#define RREP(i,n,N) for(ll i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll inf=1e9+7;

int n;
int A[51];
int ans;
int main(){
    cin>>n;
    REP(i,0,n){
        cin>>A[i];
    }
    sort(A,A+n);

    REP(i,0,n){
        ans+=abs(A[i] - (i+1));
    }
    p(ans);
    return 0;
}