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>).
INF = 10**10
n = int(input())
nums = list(map(int, input().split()))
s = 0
seen = set()
under = []
over = []

for num in nums:
    if num <= n:
        if num in seen:
            over.append(num)
        else:
            seen.add(num)
    else:
        under.append(num - n)

over = sorted(over)
under = sorted(under)

for i in range(1, n + 1):
    if i in seen:
        continue

    d_ = 0 if not over else abs(over[-1] - i)
    u_ = 0 if not under else abs(under[-1] - i)

    if d_ < u_:
        s += d_
        over.pop()
    else:
        s += u_
        under.pop()

print(s)
