B'During Zhongkao examination, Reycloer met an interesting problem, but he cannot come up with a solution immediately. Time is running out! Please help him. Initially, you are given an array a consisting of n ge 2 integers, and you want to change all elements in it to 0 . In one operation, you select two indices l and r ( 1 <= l <= r <= n ) and do the following: You can use the operation above in any order at most 8 times in total. Find a sequence of operations, such that after performing the operations in order, all elements in a are equal to 0 . It can be proven that the solution always exists. The first line of input contains a single integer t ( 1 <= t <= 500 ) -- the number of test cases. The description of test cases follows. The first line of each test case contains a single integer n ( 2 <= n <= 100 ) -- the length of the array a . The second line of each test case contains n integers a_1,a_2, ldots,a_n ( 0 <= a_i <= 100 ) -- the elements of the array a . For each test case, in the first line output a single integer k ( 0 <= k <= 8 ) -- the number of operations you use. Then print k lines, in the i -th line output two integers l_i and r_i ( 1 <= l_i <= r_i <= n ) representing that you select l_i and r_i in the i -th operation. Note that you do not have to minimize k . If there are multiple solutions, you may output any of them. In the first test case, since 1 oplus2 oplus3 oplus0=0 , after performing the operation on segment [1,4] , all the elements in the array are equal to 0 . In the second test case, after the first operation, the array becomes equal to [3,1,4,15,15,15,15,6] , after the second operation, the array becomes equal to [0,0,0,0,0,0,0,0] . In the third test case: In the fourth test case, the initial array contains only 0 , so we do not need to perfo'...