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>).
import sys
limit = int(sys.stdin.readline())
arr = sorted(list(map(int, sys.stdin.readline().split())))
cnt = 0


if arr[0] <= 0:
    cnt += (abs(arr[0]) + 1)
    arr[0] = 1

for x in range(1, limit):
    if arr[x] <= 0:
        cnt += (abs(arr[x]) + 1)
        arr[x] = abs(arr[x])
    elif arr[x] > limit:
        cnt += (arr[x] - limit)
        arr[x] = limit
    if arr[x] == arr[x - 1]:
        arr[x] += 1
        cnt += 1
sys.stdout.write(str(cnt))