One day Jay, on getting his first salary, decides to distribute apples among the poverty-stricken persons. He gave each person 1kg of apples. People are coming in a queue and he makes sure that he gives every person 1 kg of apples only once. Every person is identified by a specific integer.
Given the length of the queue N followed by an array of N integers, denoting the persons in that queue, find the minimum kg's of apples Jay will have to distribute.
The first line of the input contains an integer T denoting the number of test cases. For each test case there will be two test lines. The first line contains the length of queue N. The second line contains the N space seperated integers which denotes the people in the queue.
For each test case, output a single line containing the answer.
1 ≤ T ≤ 20
1 ≤ N ≤ 105
1 ≤ Ai ≤ 105
1 1 1 1 1
1 2 3 1 2
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.