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

typedef long long ll;

const int N = 5e5 + 5;
const int M = 135;

ll T, n, a[N], ans[N], f[M][M], g[M][M];

inline void solve() {
	cin >> n;
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
		ans[i] = 0;
	}
	if (n == 1) {
		cout << a[0] << "\n";
		return;
	}
	if (n <= 130) {
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				f[i][j] = g[i][j] = 0;
			}
			f[i][i] = g[i][i] = a[i];
		}
		for (int i = 0; i < n; ++i) {
			for (int j = 1; j < n; ++j) {
				int k = (i + j) % n;
				f[i][k] = f[i][(i + j - 1) % n] / 2 + a[k];
			}
		}
		for (int i = 0; i < n; ++i) {
			for (int j = 1; j < n; ++j) {
				int k = (i - j + n) % n;
				g[i][k] = g[i][(i - j + 1 + n) % n] / 2 + a[k];
			}
		}
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				if (i == j) {
					continue;
				}
				if (j == (i + 1) % n) {
					ans[i] = max(ans[i], f[j][i]);
				} else {
					ans[i] = max(ans[i], f[j][i] + g[(j - 1 + n) % n][(i + 1) % n] / 2);
				}
			}
		}
	} else {
		for (int i = 0; i < n; ++i) {
			ans[i] = a[i];
			ll t = 0;
			for (int j = 64; j; --j) {
				t += a[(i + j) % n];
				t /= 2;
			}
			ans[i] += t;
			t = 0;
			for (int j = 64; j; --j) {
				t += a[(i - j + n) % n];
				t /= 2;
			}
			ans[i] += t;
		}
	}
	for (int i = 0; i < n; ++i) {
		cout << ans[i] << " \n"[i == n - 1];
	}
}

int main() {
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}