#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
#define int long long
#define deb(x) cout << #x << "=" << x << endl;
#define deb2(x, y) cout << #x << "=" << x << ", " << #y << "=" << y << endl;
#define all(x) x.begin(), x.end()
#define PI 3.1415926535897932384626

void PrintArray(int a[], int n) {
	for (int i = 0; i < n; i++)
		cout << a[i] << " ";
	cout << endl;
}

void Solve() {
	int n; cin >> n;
	int a[n], b[n], S = 0;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		S += a[i];
	}
	int diff = 0;
	for (int i = 0; i < n; i++) {
		if (i & 1) b[i] = 1;
		else b[i] = a[i];
		diff += abs(a[i] - b[i]);
	}

	if (2 * diff <= S) {
		PrintArray(b, n);
		return;
	}

	for (int i = 0; i < n; i++) {
		if (i & 1) b[i] = a[i];
		else b[i] = 1;
	}

	PrintArray(b, n);
}

signed main() {
	FAST;
#ifndef ONLINE_JUDGE
	freopen("../input1.txt", "r", stdin);
	freopen("../output1.txt", "w", stdout);
#endif

	int tt; cin >> tt; while (tt--)
		Solve();
	return 0;
}
### Prompt

Your task is to create a Cpp solution to the following problem:

You are given an array [a_1, a_2, ..., a_n] such that 1 ≤ a_i ≤ 10^9. Let S be the sum of all elements of the array a.

Let's call an array b of n integers beautiful if:

  * 1 ≤ b_i ≤ 10^9 for each i from 1 to n; 
  * for every pair of adjacent integers from the array (b_i, b_{i + 1}), either b_i divides b_{i + 1}, or b_{i + 1} divides b_i (or both); 
  * 2 ∑ _{i = 1}^{n} |a_i - b_i| ≤ S. 



Your task is to find any beautiful array. It can be shown that at least one beautiful array always exists.

Input

The first line contains one integer t (1 ≤ t ≤ 1000) — the number of test cases.

Each test case consists of two lines. The first line contains one integer n (2 ≤ n ≤ 50).

The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9).

Output

For each test case, print the beautiful array b_1, b_2, ..., b_n (1 ≤ b_i ≤ 10^9) on a separate line. It can be shown that at least one beautiful array exists under these circumstances. If there are multiple answers, print any of them.

Example

Input


4
5
1 2 3 4 5
2
4 6
2
1 1000000000
6
3 4 8 1 2 3


Output


3 3 3 3 3
3 6
1 1000000000
4 4 8 1 3 3

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
#define int long long
#define deb(x) cout << #x << "=" << x << endl;
#define deb2(x, y) cout << #x << "=" << x << ", " << #y << "=" << y << endl;
#define all(x) x.begin(), x.end()
#define PI 3.1415926535897932384626

void PrintArray(int a[], int n) {
	for (int i = 0; i < n; i++)
		cout << a[i] << " ";
	cout << endl;
}

void Solve() {
	int n; cin >> n;
	int a[n], b[n], S = 0;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		S += a[i];
	}
	int diff = 0;
	for (int i = 0; i < n; i++) {
		if (i & 1) b[i] = 1;
		else b[i] = a[i];
		diff += abs(a[i] - b[i]);
	}

	if (2 * diff <= S) {
		PrintArray(b, n);
		return;
	}

	for (int i = 0; i < n; i++) {
		if (i & 1) b[i] = a[i];
		else b[i] = 1;
	}

	PrintArray(b, n);
}

signed main() {
	FAST;
#ifndef ONLINE_JUDGE
	freopen("../input1.txt", "r", stdin);
	freopen("../output1.txt", "w", stdout);
#endif

	int tt; cin >> tt; while (tt--)
		Solve();
	return 0;
}
```