#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

int consistency1(int n){
	if(n==1) return 0;
	if(n==2) return max(0LL, a[0] + a[1]);

	vector<vector<int>> dp(n, vector<int>(2, 0));
	dp[0][0] = 0; // HH type
	dp[0][1] = 0; // HHH type
	
	dp[1][0] = a[0] + a[1];
	dp[1][1] = 0;
	
	
	for(int i=2; i<n; i++){
		int last2Sum = a[i] + a[i-1];
		int last3Sum = a[i] + a[i-1] + a[i-2];
		
		dp[i][0] = last2Sum;
		if(i-3>=0)	dp[i][0] = max(dp[i][0] , last2Sum + dp[i-3][0]);
		
		for(int j=i-4; j>=0; j--){
			dp[i][0] = max(  dp[i][0], last2Sum + max(dp[j][0], dp[j][1]) );
		}
		
		
		dp[i][1] = last3Sum;
		for(int j=i-5; j>=0; j--){
			dp[i][1] = max(dp[i][1], last3Sum + max(dp[j][0],  dp[j][1]) );
		}
		
	}

	int maxi = 0;
	
	for(int i=0; i<n; i++){
		maxi = max({maxi, dp[i][0], dp[i][1]});
	}
	
	return maxi;
			
}





int consistency2(int n){
	if(n==1) return 0;
	if(n==2) return max(0LL, a[0] + a[1]);

	vector<vector<int>> dp(n, vector<int>(2, 0));
	vector<int> pMaxi1(n, -INF);
	vector<int> pMaxi2(n, -INF);
	
	dp[0][0] = 0; // HH type
	dp[0][1] = 0; // HHH type
	pMaxi1[0] = 0;
	pMaxi2[0] = 0;
	
	dp[1][0] = a[0] + a[1];
	dp[1][1] = 0;
	pMaxi1[1] = dp[1][0];
	pMaxi2[1] = 0;
	
	
	for(int i=2; i<n; i++){
		int last2Sum = a[i] + a[i-1];
		int last3Sum = a[i] + a[i-1] + a[i-2];
		
		dp[i][0] = last2Sum;
		if(i-3>=0)	dp[i][0] = max(dp[i][0] , dp[i][0] + dp[i-3][0]);
		
		if(i-4>=0){
			dp[i][0] = max( dp[i][0] , last2Sum + max(pMaxi1[i-4], pMaxi2[i-4]) );
		}
		
		
		dp[i][1] = last3Sum;
		if(i-5>=0){
			dp[i][1] = max( dp[i][1] , last3Sum + max(pMaxi1[i-5], pMaxi2[i-5]) );
		}
		
		pMaxi1[i] = max(pMaxi1[i-1], dp[i][0]);
		pMaxi2[i] = max(pMaxi2[i-1], dp[i][1]);
	}

	int maxi = 0;
	
	for(int i=0; i<n; i++){
		maxi = max({maxi, dp[i][0], dp[i][1]});
	}
	
	return maxi;
			
}




















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency1(n) << " " << consistency2(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}