#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1e9+5
#define mod 1000000007
#define forn(i,n) for (int i = 0; i < n; i++)
#define deb(x) cout << #x << "=" << x << endl 
#define deb2(x,y) cout << #x << "=" << x << ", " << #y << "=" << y << endl 
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define PI 3.1415926535897932384626
#define setbits(x) __builtin_popcount(x)
#define gcd(a,b) __gcd(a,b)
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;


void solve(){
    int n; cin>>n;
    vi arr(n);
    forn(i,n)cin>>arr[i];
    ll sumodd=0,sumeven=0;
    for(int i=0;i<n;i++){
        if(i&1)sumeven+=arr[i];
        else sumodd+=arr[i];
    }
    bool odd=true;
    if(sumodd>sumeven){
        odd=false;
    }
    if(odd){
        for(int i=0;i<n;i++){
            if(i&1)cout<<arr[i]<<" ";
            else cout<<1<<" ";
        }
    }
    else{
        for(int i=0;i<n;i++){
            if(i&1)cout<<1<<" ";
            else cout<<arr[i]<<" ";
        }
    }
    cout<<"\n";
}    

int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    while(t--){
       solve();
    }

}
    	 	 			  	 	   	     	 	 		