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>).
def Building_Permutation():
    n = int(input())
    sequence = [int(x) for x in input().split(' ')]
    sequence_sorted = sorted(sequence) #in ideal case this should be 1,2,3,4,5,....,n
    valid_nums = [x for x in sequence if (x <= n and x > 0)]
    all_nums = [x for x in range(1,n+1)]

    possible_nums = []
    for x in all_nums:
        if x not in valid_nums:
            possible_nums.append(x)  
    
    possible_nums_sorted = sorted(possible_nums)
    
    marker = 0
    num_steps = 0 
    for num in sequence_sorted:
        if num in valid_nums:
            continue
        else:
            num_steps += abs(num - possible_nums_sorted[marker])
            marker += 1
    
    print(num_steps)
    return


    
Building_Permutation()