Codeforces Round #595 (Div. 3) A. Yet Another Dividing into Teams

#include<bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define fi ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define all(a) a.begin(),a.end()
#define mem(x,y) memset(x,sizeof(x),y);
#define i64 long long int
const double pi = acos(-1.0);
const int maxn = (i64)2e5+5;

int arr[105];
int main()
{
    fi;
    int t;
    cin>>t;
    while(t--)
    {
        int n,i;
        cin>>n;
        for(i = 0 ; i<n;  i++)  cin>>arr[i];
        sort(arr,arr+n);
        int team = 1;
        for(i = 1 ; i<n ; i++)
        {
            if(arr[i] - arr[i-1] == 1)
            {
                team++;
                break;
            }
        }
        cout<<team<<"\n";
    }
    return 0;
}