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>).
t=int(input())
    # n,a,b,c=map(int,input().split()) 
    # s=input()
arr=list(map(int,input().split()))
    # s=list(map(int,input()))
    # mat=[input() for i in range(4)]
val=[i for i in range(1,t+1)]
arr.sort()
cnt_1=0
for i in arr:
    cnt_1+=1
    if i>0:
        break
for i in range(t-1,-1,-1):
    if arr[i]<=t:
        cnt_l=i+1
        break
rem=arr[cnt_1-1:cnt_l]
if rem!=[]:
    for l in rem:
        if l in val:
            val.remove(l)
    cal=arr[:cnt_1-1]+arr[cnt_l:]
    move=0
    for i in range(len(cal)):
        move+=abs(cal[i]-val[i])
    print(move)
else:
    move=0
    for i in range(t):
        move+=abs(arr[i]-val[i])
    print(move)