B"Permutation p is an ordered set of integers p1, xe2 x80 x89 xe2 x80 x89p2, xe2 x80 x89 xe2 x80 x89..., xe2 x80 x89 xe2 x80 x89pn, consisting of n distinct positive integers, each of them doesn't exceed n. We'll denote the i-th element of permutation p as pi. We'll call number n the size or the length of permutation p1, xe2 x80 x89 xe2 x80 x89p2, xe2 x80 x89 xe2 x80 x89..., xe2 x80 x89 xe2 x80 x89pn. You have a sequence of integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an. 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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x893 xc2 xb7105) -- the size of the sought permutation. The second line contains n integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an ( xe2 x80 x89- xe2 x80 x89109 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109). Print a single number -- the minimum number of moves. Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier. In the first sample you should decrease the first number by one and then increase the second number by one. The resulting permutation is (2, xe2 x80 x891). In the second sample you need 6 moves to build permutation (1, xe2 x80 x893, xe2 x80 x892)."...