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
from collections import Counter
n=int(stdin.readline())
arr=list(map(int,stdin.readline().split()))
arr.sort()
counter=Counter(arr)
distinct=[False for i in range(n+1)]
count=0
empty=[]
distinct[0]='nevermind'
for i in range(len(arr)):
    if arr[i] >0 and arr[i] < n+1:
        distinct[arr[i]]=True

for i in range(1,n+1):
    if distinct[i]==False:
        empty.append(i)

for i in range(n):
    if len(empty)==0:
        break
    if arr[i]< 1 or arr[i] > n :
        count+=max(arr[i],empty[0]) - min(arr[i],empty[0])
        arr[i]=empty[0]
        empty.pop(0)
        distinct[i]=True
    else:
        if counter[arr[i]]>1:
            count += max(arr[i], empty[0]) - min(arr[i], empty[0])
            arr[i] = empty[0]
            empty.pop(0)
            distinct[i] = True

print(count)
