Sorting#2684
cards are numbered from to (1 \leq N \leq 32767). These cards have been shuffled and placed in a single row on the table from left to right. In one move, you can swap any two cards. Find the minimum number of moves needed to arrange the cards in ascending order by their numbers.
A single line contains first the number , then distinct natural numbers, each not exceeding . These numbers are the labels of the cards as they currently lie on the table.
Output a single number: the minimum number of moves required.
Example 1