#include<bits/stdc++.h>
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
using namespace std;
template<class T> using Arr = std::vector<T>;
typedef long long LL;
const int MAXN = 500002;
const int THRE = 120;
int n;
int a[MAXN*2];
#define REG(x)(((x)-1) % n + 1)
int bit[MAXN*2];
LL val[MAXN*2];
pair<LL,int> left_ans[MAXN*2],right_ans[MAXN*2];
LL ans1[MAXN*2],ans2[MAXN*2];

void BruteF() {
    static LL f[THRE+10][2*THRE+10];
    static LL g[THRE+10][2*THRE+10];
    for(int i = 1;i <= n;++i)
        for(int j = 1;j <= 2*n;++j)
            g[i][j] = f[i][j] = 0;
    for(int i = 1;i <= n;++i) {
        f[i][i] = 0;
        for(int j = i+1; j <= i+n-1;++j)
            f[i][j] = ( f[i][j-1] + a[REG(j-1)] ) / 2;
        g[i][n+i] = 0;
        for(int j = n+i-1; j > i; --j)
            g[i][j] = ( g[i][j+1] + a[REG(j+1)] ) / 2;
    }
    for(int i = 1;i <= n;++i) {
        LL ans = 0;
        for(int j = 1; j <= n; ++j)
            ans = std::max( ans , f[j%n+1][i] + f[j%n+1][n+i] + g[j][i] + g[j][n+i] );
        ans1[i] = ans + a[i];
        cout << ans1[i] << " ";
    }
    cout << endl;
}

void solve() {
    cin >> n;
    for(int i = 1;i <= n;++i)  {
        cin >> a[i];
        a[i+n] = a[i];
    }

    if( n < THRE )
        return BruteF();
    
    LL nxt;
    for(int i = 1;i <= 2*n;++i) {
        int p = i;
        LL now = a[p];
        for(; p >= 1 && now; --p) {
            if( now > 0 && p != i )
                right_ans[p] = make_pair( val[p+1] , i );
            val[p] += (now + bit[p])/2;
            nxt = (nxt+bit[p])/2;
            if( now&1 && bit[p] ) bit[p] = 0;
            else if( !bit[p] && now&1 ) bit[p] = 1;
            now = nxt;
        }
    }
    for(int i = 1;i <= 2*n;++i) val[i] = bit[i] = 0;
    for(int i = 2*n;i >= 1;--i) {
        int p = i;
        LL now = a[p];
        for(; p <= 2*n && now;++p) {
            if( now > 0 && p != i )
                left_ans[p] = make_pair( val[p-1] , i );
            val[p] += ( now + bit[p] ) / 2;
            nxt = ( nxt + bit[p] ) / 2;
            if( now&1 && bit[p] ) bit[p] = 0;
            else if( !bit[p] && now&1 ) bit[p] = 1;
            now = nxt;
        }
    }

    for(int i = 1;i <= n;++i) {
        LL ans = right_ans[i].first + left_ans[i+n].first + a[i];
        int pos1 = right_ans[i].second,
            pos2 = left_ans[i].second;
        if( pos1 > n ) pos1 -= n;
        if( pos2 > n ) pos2 -= n;
        if( pos1 > i && pos2 < i );
        else if( pos1 > i ) {
            if( pos1 < pos2 );
            else --ans;
        }
        else {
            if( pos1 < pos2 );
            else --ans;
        }
        cout << ans << " ";
    }
    cout << endl;
}

int main() {
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    while(T--)
        solve();
    return 0 ;
}