#include<bits/stdc++.h>
using namespace std;
#define int long long
int T;
int n,f=1;
int a[500001];
int s[500001];
signed main(){
    freopen("gameemag.in","r",stdin);
    freopen("gameemag.out","w",stdout);
    cin>>T;
    while(T--){
        cin>>n;
        int mi;
        for(int i=1;i<=n;i++)cin>>a[i],f&=(i==1?1:(a[i]==a[i-1])),mi=i==1?INT_MAX:min(mi,a[i]+a[i-1]),s[i]=s[i-1]+a[i];
        int ans=0;
        if(f){
            if(n&1)cout<<mi<<' '<<s[n]-mi<<'\n';
            else cout<<1ll*a[1]*(n-(n-1)/2)<<' '<<1ll*(n-1)/2*a[1]<<'\n';
        }else{
            if(n&1){
                cout<<mi<<' '<<s[n]-mi<<'\n';
            }else{
                for(int i=0;i<=(n-1)/2;i++){//B在两侧分别吃i个和（n-1）/2-i个 
                    if(ans<s[i]+s[n]-s[n-(n-1)/2+i]){
                        ans=max(ans,s[i]+s[n]-s[n-(n-1)/2+i]);  
//                        printf("choosing %d to %d and %d to %d is better:%d\n",0,i,n-(n-1)/2+i,n,ans);
                        
                    }
                }
                cout<<s[n]-ans<<' '<<ans<<'\n';
            }
        }
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}