#include #include #include #include #include #include #include bool less(int a,int b) { if(a=j) break; swap(arr,i,j); } swap(arr,lo,j); return j; } void quickSort(int arr[],int lo,int hi) { if(hi<=lo) return; int j=comparison(arr,lo,hi); quickSort(arr,lo,j-1); quickSort(arr,j+1,hi); } int main(int argc, char const *argv[]) { int n; scanf("%d",&n); int arr[n]; for (int i = 0; i < n; ++i) scanf("%d",&arr[i]); quickSort(arr,0,n-1); int ans=0,count=0,num,j; for (int i = 0; i < n; ++i) { num=arr[i]; j=i+1; count=1; while(arr[j]-num <=1 && j