import heapq


n = int(input())
a = list(map(int, input().split()))
q = []
for i in range(n):
    heapq.heappush(q, a[i])

ans = 0
for i in range(1, n + 1):
    tmp = heapq.heappop(q)
    ans += abs(tmp - i)
print(ans)