You are given an array a consists of n elements, find the maximum number of elements you can select from the array such that the absolute difference between any two of the chosen elements is ≤ 1.
Input
The first line contains an integer T (1 ≤ T ≤ 100), in which T is the number of test cases.
The first line of each test case consist of an integer n (2 ≤ n ≤ 104), in which n is size of the array a
The a line follow containing n elements a1, a2, ..., an (1 ≤ ai ≤ 104), giving the array a.
Output
For each test case, print a single line containing the maximum number of elements you can select from the array such that the absolute difference between any two of the chosen elements is ≤ 1.
Example
Input
2
3
1 2 3
5
2 2 3 4 5
Output
2
3
#include <bits/stdc++.h>
using namespace std;
const int N=10010;
int a[N];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
memset(a,0,sizeof(a));
for(int i=1; i<=n; i++)
{
int x;
scanf("%d",&x);
a[x]++;
}
int ans=0;
a[0]=0;
for(int i=1; i<=10000; i++)
{
if(a[i]!=0)
{
a[i]+=a[i+1];
}
ans=max(ans,a[i]);
}
cout<<ans<<endl;
}
return 0;
}