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>).
# IN THE NAME OF ALLAH

N = 3 * pow(10, 5) + 1

n = int(input())
inp = input().split()
inp = [int(i) for i in inp]
flag = []
for i in range(N): flag.append(False)
a = []
b=[]
ans=0

for i in range(n):
    if(inp[i]>=1 and inp[i]<N and inp[i]<=n):
        if flag[inp[i]]==False :
            flag[inp[i]]=True
        else:
            a += [inp[i]]
    else:
        a+=[inp[i]]
a.sort()

for i in range(1,n+1):
    if flag[i]==False:
        b+=[i]

for i in range(len(a)):
    ans+=abs(a[i]-b[i])
print(ans)
