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;
#define N 10010
int arr[N];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
memset(arr, 0 ,sizeof arr);
int n;
scanf("%d",&n);
for(int i =1;i<=n;++i)
{
int x;
scanf("%d",&x);
arr[x]++;
}
int ans = 0;
for(int i = 1;i <= 10000; ++i)
{
ans = max(arr[i] + arr[i + 1], ans);
}
printf("%d\n",ans);
}
return 0;
}