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

vector<int> consistency(int n){

	vector<vector<int>> dp(n, vector<int>(2,0));
	if(a[0] & 1){
		dp[0][0] = 1;
		dp[0][1] = 0;
	}
	else{
		dp[0][0] = 0;
		dp[0][1] = 1;
	}
	
	for(int i=1; i<n; i++){
		
		if(a[i] & 1){
			dp[i][0] = dp[i-1][1];
			if(i-2>=0) dp[i][0] += dp[i-2][1];
			
			dp[i][1] = dp[i-1][0];
			if(i-2>=0) dp[i][1] += dp[i-2][0];
		}
		else{
			dp[i][0] = dp[i-1][0];
			if(i-2>=0) dp[i][0] += dp[i-2][0];
			
			dp[i][1] = dp[i-1][1];
			if(i-2>=0) dp[i][1] += dp[i-2][1];
		}
		
	}
	
	return dp[n-1];

}















vector<int> practice(int n){


}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    auto ans = consistency(n);
    
    cout << "Odd Ways : " << ans[0] << " , Even Ways : " << ans[1] << 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;
}