B"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: You have to answer q independent queries. The first line of the input contains one integer q ( 1 <= q <= 100 ) -- the number of queries. Then q queries follow. The first line of the query contains one integer n ( 1 <= n <= 100 ) -- the number of students in the query. The second line of the query contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 100 , all a_i are distinct), where a_i is the programming skill of the i -th student. 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 ) 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. "...