Bit Lightyear, to the ANDfinity and beyond! After graduating from computer sciences, Vlad has been awarded an array a_1,a_2, ldots,a_n of n non-negative integers. As it is natural, he wanted to construct a graph consisting of n vertices, numbered 1, 2, ldots, n . He decided to add an edge between i and j if and only if a_i & a_j > 0 , where & denotes the bitwise AND operation. Vlad also wants the graph to be connected, which might not be the case initially. In order to satisfy that, he can do the following two types of operations on the array: It can be proven that there exists a finite sequence of operations such that the graph will be connected. So, can you please help Vlad find the minimum possible number of operations to do that and also provide the way how to do that? There are several test cases in the input data. The first line contains a single integer t ( 1 <= q t <= q 1000 ) -- the number of test cases. This is followed by the test cases description. The first line of each test case contains an integer n ( 2 <= q n <= q 2000 ). The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 0 <= q a_i < 2^{30} ) -- the elements of the array. It is guaranteed that the sum of n over all test cases does not exceed 2000 . For each test case, print a single integer m in the first line -- the minimum number of operations. In the second line print the array after a valid sequence of operations that have been done such that the graph from the task becomes connected. If there are multiple solutions, output any. In the first test case, the graph is already connected. In the second test case, we can increment 0 twice and end up with the array [2,2] . Since 2 & 2 = 2 > 0 , the graph is connected. It can be shown that one operation is not enough. In the third test case, we can decrement 12 once and we end up with an a