B"A sequence of non-negative integers a_1, a_2, ... , a_n is called growing if for all i from 1 to n - 1 all ones (of binary representation) in a_i are in the places of ones (of binary representation) in a_{i + 1} (in other words, a_i : & : a_{i + 1} = a_i , where & denotes bitwise AND). If n = 1 then the sequence is considered growing as well. For example, the following four sequences are growing: The following three sequences are non-growing: Consider two sequences of non-negative integers x_1, x_2, ... , x_n and y_1, y_2, ... , y_n . Let's call this pair of sequences co-growing if the sequence x_1 oplus y_1, x_2 oplus y_2, ... , x_n oplus y_n is growing where oplus denotes bitwise XOR. You are given a sequence of integers x_1, x_2, ... , x_n . Find the lexicographically minimal sequence y_1, y_2, ... , y_n such that sequences x_i and y_i are co-growing. The sequence a_1, a_2, ... , a_n is lexicographically smaller than the sequence b_1, b_2, ... , b_n if there exists 1 <= k <= n such that a_i = b_i for any 1 <= i < k but a_k < b_k . The first line contains an integer t ( 1 <= t <= 10^4 ). Then t test cases follow. The first line of each test case contains an integer n ( 1 <= n <= 2 cdot 10^5 ) -- length of the sequence x_i . The second line contains n integers x_1, x_2, ... , x_n ( 0 <= x_i < 2^{30} ) -- elements of the sequence x_i . It is guaranteed that the sum of n overall all test cases doesn't exceed 2 cdot 10^5 . For each test case, print n integers y_1, y_2, ... , y_n ( 0 <= y_i < 2^{30} ) -- lexicographically minimal sequence such that such that it's co-growing with given sequence x_i . "...