Problem: Let's call an array a_1, a_2, ..., a_m of nonnegative integer numbers good if a_1 + a_2 + ... + a_m = 2⋅(a_1 ⊕ a_2 ⊕ ... ⊕ a_m), where ⊕ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR).

For example, array [1, 2, 3, 6] is good, as 1 + 2 + 3 + 6 = 12 = 2⋅ 6 = 2⋅ (1⊕ 2 ⊕ 3 ⊕ 6). At the same time, array [1, 2, 1, 3] isn't good, as 1 + 2 + 1 + 3 = 7 ≠ 2⋅ 1 = 2⋅(1⊕ 2 ⊕ 1 ⊕ 3).

You are given an array of length n: a_1, a_2, ..., a_n. Append at most 3 elements to it to make it good. Appended elements don't have to be different. It can be shown that the solution always exists under the given constraints. If there are different solutions, you are allowed to output any of them. Note that you don't have to minimize the number of added elements!. So, if an array is good already you are allowed to not append elements.

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 10 000). The description of the test cases follows.

The first line of each test case contains a single integer n (1≤ n ≤ 10^5) — the size of the array.

The second line of each test case contains n integers a_1, a_2, ..., a_n (0≤ a_i ≤ 10^9) — the elements of the array.

It is guaranteed that the sum of n over all test cases does not exceed 10^5.

Output

For each test case, output two lines.

In the first line, output a single integer s (0≤ s≤ 3) — the number of elements you want to append.

In the second line, output s integers b_1, ..., b_s (0≤ b_i ≤ 10^{18}) — the elements you want to append to the array.

If there are different solutions, you are allowed to output any of them.

Example

Input


3
4
1 2 3 6
1
8
2
1 1


Output


0

2
4 4
3
2 6 2

Note

In the first test case of the example, the sum of all numbers is 12, and their ⊕ is 6, so the condition is already satisfied.

In the second test case of the example, after adding 4, 4, the array becomes [8, 4, 4]. The sum of numbers in it is 16, ⊕ of numbers in it is 8.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long Mod = 998244353;
const long long INF = (1LL << 60);
namespace IO {
template <typename T>
inline void read(T &x) {
  char c = getchar();
  int f = 1;
  x = 0;
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -1;
  for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
  x *= f;
}
template <typename T>
inline void write(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
template <typename T>
inline void chkmin(T &x, T y) {
  x = x < y ? x : y;
}
template <typename T>
inline void chkmax(T &x, T y) {
  x = x > y ? x : y;
}
}  // namespace IO
namespace CALC {
template <typename T>
inline void Add(T &x, T y) {
  x = (x + y) % Mod;
}
template <typename T>
inline void Sub(T &x, T y) {
  x = ((x - y) % Mod + Mod) % Mod;
}
template <typename T>
inline T pls(T x, T y) {
  return (x + y) % Mod;
}
template <typename T>
inline T slp(T x, T y) {
  return ((x - y) % Mod + Mod) % Mod;
}
inline long long qpow(long long x, long long y) {
  long long ret = 1;
  for (; y; y >>= 1, x = x * x % Mod)
    if (y & 1) ret = ret * x % Mod;
  return ret;
}
}  // namespace CALC
using namespace IO;
using namespace CALC;
int main() {
  int T;
  read(T);
  long long Lim = 1;
  for (int i = 1; i <= 55; i++) Lim *= 2LL;
  Lim--;
  while (T--) {
    long long A = 0, S = 0, x, y, z;
    int N;
    read(N);
    for (int i = 1; i <= N; i++) {
      long long t;
      read(t);
      A ^= t;
      S += t;
    }
    x = Lim ^ A;
    if (S & 1) {
      x |= 1;
      assert(x != -INF);
    } else {
      x ^= (x & 1);
      assert(x != -INF);
    }
    int ans = 3;
    long long tmp = (S + x) >> 1;
    y = (A ^ x) - tmp;
    z = y;
    printf("%d\n%lld %lld %lld\n", ans, x, y, z);
  }
  return 0;
}