#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>
#include <bitset>
#include <map>
#include <deque>
#include <cassert>
#include <string>
#include <queue>
#include <set>
#include <ctime>
#include <unordered_set>
#include <unordered_map>
#include <random>
#include <iomanip>
#define all(x) x.begin(), x.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define flash ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
using namespace std;
//
typedef vector<int> vi;
typedef vector<long long> vll;
//
const int MOD = 1e9 + 7;
const int INF = 1e9 + 10;
const ll INFLL = 9223372036854775807;
const ll MOD1 = 1ll<<32; //2 ** 32
const int MAXN = 1e9 + 10;

void solve() {
    int n;
    cin >> n;
    vi a(n);
    ll sm1 = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sm1 += a[i];
    }
    vi b(n, 0);
    b[0] = a[0];
    for (int i = 1; i < n; i++) {
        int cur = a[i];
        /*while (cur % b[i - 1] != 0 && cur > 1) {
            cur--;
        }*/
        cur = max(cur - cur % b[i - 1], 1);
        b[i] = cur;
    }
    ll sm = 0;
    for (int i = 0; i < n; i++) {
        sm += abs(a[i] - b[i]);
        cout << b[i] << ' ' ;
    }
    cout << "\n";
    // cout << "\n sm * 2, sm_a = " << sm * 2 << ' ' << sm1 << "\n";
}

signed main() {
    flash
    //
    int t; cin >> t;
    while (t--) {
        solve();
    }
}