#include <cstdio>
#include <algorithm>

int T;

int main() {
    freopen("gameemag.in", "r", stdin);
    freopen("gameemag.out", "w", stdout);
    scanf("%d", &T);
    while (T--) {
        int n, bchoose;
        scanf("%d", &n);
        
        bchoose = n / 2 - 1;
        std::vector<int> a(n + 1);
        std::vector<long long> prefix(n + 1), suffix(n + 1);
        long long sum = 0;
        
        for (int i = 1; i <= n; ++i) {
            scanf("%d", &a[i]);
            sum += a[i];
        }
        for (int i = 1; i <= n; ++i) {
            prefix[i] = prefix[i - 1] + a[i];
        }
        for (int i = 1; i <= n; ++i) {
            suffix[i] = suffix[i - 1] + a[n - i + 1];
        }
        
        long long ansa = 0, ansb = 0;
        for (int left = 0; left <= bchoose; ++left) {
            int right = bchoose - left;
            ansb = std::max(ansb, prefix[left] + suffix[right]);
        }
        ansa = sum - ansb;
        printf("%lld %lld\n", ansa, ansb);
    }
    
    return 0;
}