#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){

	int total = 0;
	for(int i=0; i<n; i++) total += a[i];
	
	if(total % 4 != 0) return false;
	int x = total/4;
	
	unordered_map<int,int> prefixSum;
	unordered_map<int,int> suffixSum;
	
	int sum = 0;
	for(int i=n-1; i>=2; i--){
		sum += a[i];
		suffixSum[sum]++;
	}
	prefixSum[a[0]]++;
		
	
	int ans = 0;
	int leftSum = a[0];

	
	for(int i=1; i<=n-2; i++){
		
		leftSum += a[i];
		int rightSum = total - leftSum;
		
		suffixSum[rightSum]--;
		if(suffixSum[rightSum] == 0) suffixSum.erase(rightSum);
		
		
		if(leftSum == 2*x && rightSum == 2*x){
			ans += prefixSum[leftSum/2] * suffixSum[rightSum/2];
		}
		
		prefixSum[leftSum]++;
	}
	
	return ans;
	
}





int consistency2(int n){

	int total = 0;
	for(int i=0; i<n; i++) total += a[i];
	
	if(total % 4 != 0) return false;
	int y = total/4;
	
	
	vector<int> suffixCt(n+1, 0);
	
	int x = 0;
	int xx = 0;
	int sum = 0;
	for(int i=n-1; i>=0; i--){
		sum += a[i];
		
		if(sum == 2*y){
			xx = x;
			suffixCt[i] = xx;
		}
		else suffixCt[i] = suffixCt[i+1];
		
		if(sum == y)	x++;
		
	}

	
	sum = a[0];
	x = a[0] == y ? 1 : 0;
	xx = 0;
	
	int ans = 0;
	
	for(int i=1; i<=n-3; i++){
		sum += a[i];
		
		if(sum == 2*y){
			xx = x;
		
			int leftCt = xx;
			int rightCt = suffixCt[i+1];
			ans += leftCt * rightCt;
		}
		if(sum == y) x++;
		
	}
	
	return ans;
	
}























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;
}