#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 1e6 + 5;
int t, n, a[N];
int pref[N];
vector<int> g[N];
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> t;
    while(t--) {
		cin >> n;
		int mx = 0;
		for(int i = 1;i <= n;i++) {
			cin >> a[i];
			mx = max(mx, a[i]);
		}
		pref[n + 1] = pref[n + 2] = 0;
		for(int i = n;i >= 1;i--)
			pref[i] = pref[i + 2] + a[i];
		set<int> st;
		g[a[n + 1]].clear();
		g[0].clear();
		for(int i = 0;i <= n + 1;i++) {
			st.insert(i);
			g[a[i]].push_back(i);
		}
		a[n + 1] = 0;
		for(int b = 1;b <= mx;b++) {
			int p = 0;
			int ans = 0;
			for(auto it = st.begin();*it <= n;it++) {
				int nxt = *next(it);
				if(*it + 1 != nxt) {
					bool flip = ((*it % 2) == (nxt % 2));
					if(!p)
						ans += pref[*it + 1] - pref[nxt + flip];	
					else
						ans += pref[*it + 2] - pref[nxt + !flip];
					p ^= flip;
				}
				int cnt = a[nxt] / b, rem = a[nxt] % b;
				ans += ((cnt + !p) / 2) * b;
				p ^= (cnt & 1);
				if(rem) {
					ans += !p * rem;
					p ^= 1;
				}
			}
			for(auto i : g[b])
				st.erase(i);
			cout << ans << '\n';
		}
		for(int i = 1;i <= n + 1;i++)
			g[a[i]].clear();
	}
    return 0;
}