Make a Permutation

You are given an integer sequence $A$ with length $N$. In one move, you are allowed to choose one element of this sequence and change it to an arbitrary integer. Compute the minimum number of moves needed to make the sequence a permutation of the integers $1$ through $N$. ### Input - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of