Devu and friendship testing

Devu has n weird friends. Its his birthday today, so they thought that this is the best occasion for testing their friendship with him. They put up conditions before Devu that they will break the friendship unless he gives them a grand party on their chosen day. Formally, i^th friend will break his friendship if he does not receive a grand party on d_i^th day.

Devu despite being as rich as Gatsby, is quite frugal and can give at most one grand party daily. Also, he wants to invite only one person in a party. So he just wonders what is the maximum number of friendships he can save. Please help Devu in this tough task !!

Input

• The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
• First line will contain a single integer denoting n.
• Second line will contain n space separated integers where i^th integer corresponds to the day d_i^th as given in the problem.

Output

Print a single line corresponding to the answer of the problem.

Constraints

• 1 = T = 10⁴
• 1 = n = 50
• 1 = d_i = 100

Example

Input:
2
2
3 2
2
1 1
Output:
2
1

Solution

#include<stdio.h>
int main()
{   int n1,i1,i,n,sum[100],p;
    scanf("%d",&n1);
    for(i1=0;i1<n1;i1++)
    {
        scanf("%d",&n);
        int a;
        for(i=0;i<100;i++)
        sum[i]=0;
       
        for(i=0;i<n;i++)
        { 
            scanf("%d",&a);
            sum[(a-1)]=1;
        }
        p=0;
        for(i=0;i<100;i++)
        {
            if(sum[i]==1)
            p=(p+1);
        }
        printf("%d\n",p);
    }
}