#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int,int> PII;

const int mod=998244353;
const int N=5e5+5;

int T,n;
int a[N];

LL calc(int i,int j,int step){
	LL ans=0;
	for(int k=j;k!=i;k=(k+step+n)%n)
		ans=(a[k]+ans)>>1;
	return ans;
}
//1 5 2 1 3 1 2

int main(){
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		for(int i=0;i<n;++i)
			scanf("%d",&a[i]);
		if(n==1){
			printf("%d\n",a[0]);
		}else if(n<=80){
			for(int i=0;i<n;++i){
				LL ans=a[i],tmp=a[i]>>1;
				int j=(i+(n>>1))%n;
				for(int k=j,cnt=0;cnt<=2;++cnt,k=(k-1+n)%n){
					ans=max(ans,a[i]+calc(i,k,-1)+calc(i,(k+1)%n,1));
					if(k==i) break;
				}
				for(int k=j,cnt=0;cnt<=2;++cnt,k=(k+1)%n){
					ans=max(ans,a[i]+calc(i,k,-1)+calc(i,(k+1)%n,1));
					if((k+1+n)%n==i) break;
				} 
				a[i]-=tmp;
				a[(i+1)%n]+=tmp;
				for(int k=j,cnt=0;cnt<=2;++cnt,k=(k-1+n)%n){
					ans=max(ans,a[i]+calc(i,k,-1)+calc(i,(k+1)%n,1));
					if(k==i) break;
				}
				for(int k=j,cnt=0;cnt<=2;++cnt,k=(k+1)%n){
					ans=max(ans,a[i]+calc(i,k,-1)+calc(i,(k+1)%n,1));
					if((k+1+n)%n==i) break;
				} 
				a[(i+1)%n]-=tmp;
				a[(i+n-1)%n]+=tmp;
				for(int k=j,cnt=0;cnt<=2;++cnt,k=(k-1+n)%n){
					ans=max(ans,a[i]+calc(i,k,-1)+calc(i,(k+1)%n,1));
					if(k==i) break;
				}
				for(int k=j,cnt=0;cnt<=2;++cnt,k=(k+1)%n){
					ans=max(ans,a[i]+calc(i,k,-1)+calc(i,(k+1)%n,1));
					if((k+1+n)%n==i) break;
				} 
				a[(i+n-1)%n]-=tmp;
				a[i]+=tmp;
				printf("%lld ",ans);
			}
			puts("");
		}else{
			for(int i=0;i<n;++i){
				LL ans=a[i],tmp=a[i]>>1;
				ans=max(ans,a[i]+calc(i,(i-37+n)%n,1)+calc(i,(i+37)%n,-1));
				a[i]-=tmp;
				a[(i+1)%n]+=tmp;
				ans=max(ans,a[i]+calc(i,(i-37+n)%n,1)+calc(i,(i+37)%n,-1));
				a[(i+1)%n]-=tmp;
				a[(i+n-1)%n]+=tmp;
				ans=max(ans,a[i]+calc(i,(i-37+n)%n,1)+calc(i,(i+37)%n,-1));
				a[(i+n-1)%n]-=tmp;
				a[i]+=tmp;
				printf("%lld ",ans); 
			}
			puts("");
		}
	}
	return 0;
}