You are a coach of a group consisting of $n$ students. The $i$-th student has programming skill $a_i$. All students have distinct programming skills. You want to divide them into teams in such a way that:  No two students $i$ and $j$ such that $|a_i - a_j| = 1$ belong to the same team (i.e. skills of each pair of students in the same team have the difference strictly greater than $1$);  the number of teams is the minimum possible. 

You have to answer $q$ independent queries.


-----Input-----

The first line of the input contains one integer $q$ ($1 \le q \le 100$) — the number of queries. Then $q$ queries follow.

The first line of the query contains one integer $n$ ($1 \le n \le 100$) — the number of students in the query. The second line of the query contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 100$, all $a_i$ are distinct), where $a_i$ is the programming skill of the $i$-th student.


-----Output-----

For each query, print the answer on it — the minimum number of teams you can form if no two students $i$ and $j$ such that $|a_i - a_j| = 1$ may belong to the same team (i.e. skills of each pair of students in the same team has the difference strictly greater than $1$)


-----Example-----
Input
4
4
2 10 1 20
2
3 6
5
2 3 4 99 100
1
42

Output
2
1
2
1



-----Note-----

In the first query of the example, there are $n=4$ students with the skills $a=[2, 10, 1, 20]$. There is only one restriction here: the $1$-st and the $3$-th students can't be in the same team (because of $|a_1 - a_3|=|2-1|=1$). It is possible to divide them into $2$ teams: for example, students $1$, $2$ and $4$ are in the first team and the student $3$ in the second team.

In the second query of the example, there are $n=2$ students with the skills $a=[3, 6]$. It is possible to compose just a single team containing both students.
[{"code": "for _ in range(int(input())):\n    n = int(input())\n    A = list(map(int, input().split()))\n    A.sort()\n    ans = 1\n    for i in range(n - 1):\n        if A[i] + 1 == A[i + 1]:\n            ans = 2\n            break\n    print(ans)", "passed": true, "time": 0.14, "memory": 14184.0, "status": "done"}, {"code": "q=int(input())\nfor i in range(q):\n    n=int(input())\n    a=sorted([int(x) for x in input().split()])\n    for i in range(1,n):\n        if a[i]==a[i-1]+1:\n            print(2)\n            break\n    else:\n        print(1)\n", "passed": true, "time": 0.95, "memory": 14152.0, "status": "done"}, {"code": "for _ in range(int(input())):\n    n = int(input())\n    a = list(map(int, input().split()))\n    a.sort()\n    flag = False\n    for i in range(1, n):\n        if a[i] - a[i-1] == 1:\n            flag = True\n    if flag:\n        print(2)\n    else:\n        print(1)", "passed": true, "time": 0.14, "memory": 14224.0, "status": "done"}, {"code": "Q = int(input())\n\nfor q in range(Q):\n    n = int(input())\n    L = list(map(int, input().split()))\n    L.sort()\n    y = 0\n    for i in range(1, n):\n        if L[i] - L[i-1] == 1:\n            y = 1\n    if y == 1: print(2)\n    else:\n        print(1)", "passed": true, "time": 0.95, "memory": 14220.0, "status": "done"}, {"code": "#    !/usr/bin/env python3\n#    encoding: UTF-8\n#    Last Modified: 22/Oct/2019 08:07:05 PM\n\n\nimport sys\n\n\ndef main():\n    for tc in range(int(input())):\n        n = int(input())\n        arr = get_array()\n        arr.sort()\n        f = 0\n        for i in range(1, n):\n            if arr[i] == 1 + arr[i - 1]:\n                f = 1\n        if f == 1:\n            print(2)\n        else:\n            print(1)\n\n\nget_array = lambda: list(map(int, sys.stdin.readline().split()))\n\n\nget_ints = lambda: list(map(int, sys.stdin.readline().split()))\n\n\ninput = lambda: sys.stdin.readline().strip()\n\n\ndef __starting_point():\n    main()\n\n__starting_point()", "passed": true, "time": 1.27, "memory": 14364.0, "status": "done"}, {"code": "q = int(input())\nfor i in range(q):\n    n = int(input())\n    a = [int(x) for x in input().split()]\n    a.sort()\n    ans = 1\n    for i in range(1, n):\n        if a[i] - a[i - 1] == 1:\n            ans = 2\n    print(ans)", "passed": true, "time": 0.14, "memory": 14232.0, "status": "done"}, {"code": "q = int(input())\nfor i in range(q):\n    n = int(input())\n    a = [int(i) for i in input().split()]\n    a.sort()\n    f = False\n    for i in range(n - 1):\n        if a[i] - a[i + 1] == -1:\n            print(2)\n            f = True\n            break\n    if not f:\n        print(1)\n", "passed": true, "time": 1.62, "memory": 14264.0, "status": "done"}, {"code": "#JMD\n#Nagendra Jha-4096\n\n \nimport sys\nimport math\n\n#import fractions\n#import numpy\n \n###File Operations###\nfileoperation=0\nif(fileoperation):\n    orig_stdout = sys.stdout\n    orig_stdin = sys.stdin\n    inputfile = open('W:/Competitive Programming/input.txt', 'r')\n    outputfile = open('W:/Competitive Programming/output.txt', 'w')\n    sys.stdin = inputfile\n    sys.stdout = outputfile\n\n###Defines...###\nmod=1000000007\n \n###FUF's...###\ndef nospace(l):\n    ans=''.join(str(i) for i in l)\n    return ans\n \n \n \n##### Main ####\nt=int(input())\nfor tt in range(t):\n    n=int(input())\n    #n,k,s= map(int, sys.stdin.readline().split(' '))\n    a=list(map(int,sys.stdin.readline().split(' ')))\n    a.sort()\n    ans=1\n    for i in range(n-1):\n        if(a[i]==a[i+1]-1):\n            ans=2\n            break\n    print(ans)\n    \n    \n#####File Operations#####\nif(fileoperation):\n    sys.stdout = orig_stdout\n    sys.stdin = orig_stdin\n    inputfile.close()\n    outputfile.close()", "passed": true, "time": 0.14, "memory": 14156.0, "status": "done"}, {"code": "\n\nfor _ in range(int(input())):\n\tn=int(input())\n\ta=list(map(int,input().split(\" \")))\n\ta=sorted(a)\n\n\tnow=-1\n\n\tans=1\n\n\tfor i in a:\n\t\tif(abs(i-now)<=1):\n\t\t\tans=2\n\t\t\tbreak\n\t\tnow=i\n\n\tprint(ans)", "passed": true, "time": 0.15, "memory": 14220.0, "status": "done"}, {"code": "import sys\nimport math\n# sys.stdin = open(\"in.txt\")\nfor _ in range(int(input())):\n    n = int(input())\n    li = sorted(list(map(int, input().split())))\n    was = 0\n    for i in range(n - 1):\n        if li[i + 1] - li[i] == 1:\n            was = 1\n    if was:\n        print(2)\n    else:\n        print(1)\n", "passed": true, "time": 0.14, "memory": 14272.0, "status": "done"}, {"code": "q = int(input())\nfor query in range(q):\n    n = int(input())\n    a = list(map(int, input().split(\" \")))\n    a = sorted(a)\n    res = 1\n    for i in range(n-1):\n        if abs(a[i] - a[i+1]) == 1:\n            res = 2\n            break\n    print(res)", "passed": true, "time": 0.14, "memory": 14076.0, "status": "done"}, {"code": "q = int( input() )\nfor _ in range( q ):\n    n = int( input() )\n    a = list( map( int, input().split() ) )\n    a.sort()\n    f = 1\n    for i in range( 1, n ):\n        if a[ i - 1 ] + 1 == a[ i ]:\n            f = 2\n            break\n    print( f )\n\n", "passed": true, "time": 0.14, "memory": 14312.0, "status": "done"}, {"code": "def read():\n    return list(map(int,input().split()))\n\nq = int(input())\nfor test in range(q):\n    n = int(input())\n    a = read()\n    a.sort()\n    for i in range(n-1):\n        if abs(a[i] - a[i+1]) == 1:\n            print(2)\n            break\n    else:\n        print(1)\n", "passed": true, "time": 0.19, "memory": 14272.0, "status": "done"}, {"code": "t = int(input())\nfor _ in range(t):\n    n = int(input())\n    arr = sorted(list(map(int, input().split())))\n    for i in range(n-1):\n        if arr[i]+1 == arr[i+1]:\n            print(2)\n            break\n    else:\n        print(1)\n", "passed": true, "time": 0.14, "memory": 14176.0, "status": "done"}, {"code": "t = int(input())\nfor _ in range(t):\n    n = int(input())\n    a = list(map(int, input().split()))\n    a = sorted(a)\n    flag = False\n    for i in range(n-1):\n        if a[i]+1 == a[i+1]:\n            flag = True\n    if flag:\n        print(2)\n    else:\n        print(1)", "passed": true, "time": 0.14, "memory": 14340.0, "status": "done"}, {"code": "for _ in range(int(input())):\n    n = int(input())\n    l = [int(i) for i in input().split()]\n    l.sort()\n    res = 1\n    for i in range(n - 1):\n        if (l[i] + 1 == l[i + 1]):\n            res = 2\n            break\n    print(res)", "passed": true, "time": 0.14, "memory": 14096.0, "status": "done"}, {"code": "q=int(input())\nfor i in range(q):\n    n=int(input())\n    a=list(map(int,input().split()))\n    a.sort()\n    t=False\n    for i in range(1,n):\n        if a[i]-1==a[i-1]:\n            t=True\n    if t:\n        print(2)\n    else:\n        print(1)", "passed": true, "time": 0.14, "memory": 14064.0, "status": "done"}, {"code": "q=int(input())\nfor i in range(q):\n    n=int(input())\n    l=list(map(int,input().split()))\n\n    l.sort()\n    flag=0\n    for i in range(len(l)-1):\n        if l[i+1]-l[i]==1:\n            flag=1\n            break\n    if flag:\n        print (2)\n    else:\n        print(1)", "passed": true, "time": 0.14, "memory": 14328.0, "status": "done"}, {"code": "import sys\ninput = sys.stdin.readline\n\nq = int(input())\n\nfor _ in range(q):\n    n = int(input())\n    a = list(map(int, input().split()))\n    a.sort()\n    \n    for i in range(n-1):\n        if a[i+1]-a[i] == 1:\n            print(2)\n            break\n    else:\n        print(1)", "passed": true, "time": 0.14, "memory": 14092.0, "status": "done"}, {"code": "\nq = int(input())\n\nfor i in range(q):\n\n    n = int(input())\n\n    a = list(map(int,input().split()))\n    a.sort()\n\n    ans = 1\n    for i in range(n-1):\n\n        if a[i] + 1 == a[i+1]:\n            ans = 2\n\n    print (ans)\n", "passed": true, "time": 0.14, "memory": 14116.0, "status": "done"}]