Permutation *p* is an ordered set of integers *p*<sub class="lower-index">1</sub>,  *p*<sub class="lower-index">2</sub>,  ...,  *p*<sub class="lower-index">*n*</sub>, consisting of *n* distinct positive integers, each of them doesn't exceed *n*. We'll denote the *i*-th element of permutation *p* as *p*<sub class="lower-index">*i*</sub>. We'll call number *n* the size or the length of permutation *p*<sub class="lower-index">1</sub>,  *p*<sub class="lower-index">2</sub>,  ...,  *p*<sub class="lower-index">*n*</sub>.

You have a sequence of integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub>. In one move, you are allowed to decrease or increase any number by one. Count the minimum number of moves, needed to build a permutation from this sequence.
The first line contains integer *n* (1 ≤ *n* ≤ 3·10<sup class="upper-index">5</sup>) — the size of the sought permutation. The second line contains *n* integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> ( - 10<sup class="upper-index">9</sup> ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).
from sys import stdin, stdout
import math,sys
#sys.stdout = open('output.txt', 'w')
#sys.stdin = open('input.txt','r')
from itertools import permutations, combinations
from collections import defaultdict
import bisect
import heapq as hq


def main():
    try:
       n=int(input())
       l=list(map(int,input().split()))
       #print(l)
       l.sort()
       su=0
       for i in range(n):
            su+=abs(i+1-l[i])
       print(su) 

    except:
        pass


P = 1000000007
def search(l,x):
    a,b=0,len(l)-1
    while (a<=b):
        k=(a+b)//2
        if l[k]==x:
            return k
        elif l[k]<x:
            a=k+1
        else:
            b=k-1

if __name__ == '__main__':
    main()


