#include<bits/stdc++.h>
#define N 500005 
#define int long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int T,n,m,k,op,x,y,z,ans,last;
int a[N],p[N],q[N];
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void ckmax(int &x,int y){if(y>x)x=y;}
void ckmin(int &x,int y){if(y<x)x=y;}
int fp(int a,int n,int mod){
    int ans=1;
    while(n){
        if(n&1)ans=ans*a%mod;
        a=a*a%mod;
        n>>=1;
    }
    return ans;
}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int po(int x){return x*x;}
int sub(int x,int y){return x>y?x-y:y-x;}
int ab(int x){return x<0?-x:x;}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
signed main(){
    freopen("gameemag.in","r",stdin);freopen("gameemag.out","w",stdout);
    T=read();
    while(T--){
        n=read();m=n/2-1;fo(i,1,n)a[i]=read();q[n+1]=0;
        fo(i,1,n)p[i]=p[i-1]+a[i];
        rf(i,n,1)q[i]=q[i+1]+a[i];
        x=0;fo(i,0,m)ckmax(x,p[i]+q[n-(m-i)+1]);
        printf("%lld %lld\n",p[n]-x,x);
    }
    return 0;
}