#include <bits/stdc++.h>
#include <iostream>
// #define int long long
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v)),v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
//#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
// std::mt19937_64 rng64((int) std::chrono::steady_clock::now().time_since_epoch().count());
std::mt19937 rng(
  
//  (int) std::chrono::steady_clock::now().time_since_epoch().count()
   1239010
);
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
//inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
    b%=m;
    ll ans = 1;
    for (; e; b = b * b % m, e /= 2)
        if (e & 1) ans = ans * b % m;
    return ans;
}
// debug:
template<class T>void print_vector(vector<T> &v){
    rep(i,0,sz(v))cout<<v[i]<<" \n"[i==sz(v)-1];
}
void dbg_out() {cerr << endl; }
template<typename Head, typename ... Tail> void dbg_out(Head H,Tail... T){
    cerr << ' ' << H;
    dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__), cerr << endl
#else
#define dbg(...) 42
#endif
//

const int N = 1e6 + 10;
int a[N];
int pre[N][2];
int suf[N][2];
void solve(){
    int n;
    cin >> n;
    int mx =0 ;
    for(int i=1;i<=n;i++){
        cin >> a[i];
        mx = max(mx , a[i]);
        rep(j,0,2){
            pre[i][j] = pre[i-1][j];
        }
        pre[i][i&1] += a[i];
    }
    for(int i=n+1;i>=1;i--){
        rep(j,0,2){
            suf[i][j] = (i==n+1 ? 0 : suf[i+1][j]);
        }
        suf[i][i&1] += a[i];
    }
    set<int> ids;
    set<pii> S;
    rep(i,1,n+1){
        S.insert(pii(a[i],i));
        ids.insert(i);
    }
    ids.insert(n+1);

    rep(B,1,mx+1){
        while(sz(S) && S.begin()->ff < B){
            int id = S.begin()->ss;
            ids.erase(id);
            S.erase(S.begin());
        }

        int par = 0;
        int last = 0;
        int res=0;
        for(int p : ids){
            // pegar os anteriores completos:
            int bk = ((last+1)&1)^par;
            if(last + 1 <= p-1){
                // [last+1,p-1]
                res += suf[last+1][bk] - suf[p][bk];
                // atualiza paridade:
                int qtd = (p-1-(last+1)+1); 
                if(qtd%2==1){
                    par^=1;
                }
            }   
            if( p > n )break;
            // pegar yo:
            int comp = a[p]/ B;
            int sobra = a[p]%B;
            res += comp/2 * B;
            if(par == 0){
                if(comp%2==1){
                    // pega 
                    res += B;
                }else if(sobra){
                    res += sobra;
                }
            }else{
                if(comp%2==1){
                    // OXOXO sobra
                    if(sobra > 0)
                        res += sobra;
                }else{
                    // OXOX sobra
                    // ignore
                }
            }
            par^=((comp + (sobra>0))&1);
            last = p;
        }

        cout << res << endl;
    }

    
}

int32_t main(){
    fastio;
    int t;
    cin >> t;
    while(t--){
        solve();
    }

    // math -> gcd it all
    // Did you swap N,M? N=1?
}