For this Question: There are N piles where the i<sup>th</sup> pile consists of A<sub>i</sub> stones. Chef and Chefina are playing a game taking alternate turns with Chef starting first. In his/her turn, a player can choose any non-empty pile and remove exactly 1 stone from it. The game ends when exactly 1 pile becomes empty. The player who made the last move wins. Determine the winner if both players play optimally.The first line of input will contain a single integer T, denoting the number of test cases. Each test case consists of multiple lines of input. The first line of each test case contains a single integer N denoting the number of piles. The next line contains N space-separated integers A<sub>1</sub>, A<sub>2</sub>,...., A<sub>N</sub> - denoting the number of stones in each pile.

<b>Constraints</b>
1 &le; T &le; 1000
1 &le; N &le; 10<sup>5</sup>
1 &le; A<sub>i</sub> &le; 10<sup>9</sup>
The Sum of N over all test cases does not exceed 2. 10<sup>5</sup>.For each test case, output CHEF if Chef wins the game, otherwise output CHEFINA. Sample Input :
3
2
2 2
1
10
3
1 5 6

Sample Output :
CHEFINA
CHEFINA
CHEF

Explanation :
No matter which stone the Chef removes, Chefina will remove the remaining stone from the same pile and make it empty. 
Since there is only 1 pile containing 1010 stones, the game will last exactly 10 moves with last move made by Chefina. 
The chef can remove 1 stone from the first pile and thus make it empty., I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;

const int MX = 1e5 + 5;
typedef long long LL;
LL a[MX], T, n, ans;

int main () {
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin >> T;
	while (T --) {
		
		bool flag = 0; ans = 0;
		cin >> n;
		for (int i = 0; i < n; i++) cin >> a[i];
		for (int i = 0; i < n; i++) 
			if (a[i] == 1) flag = 1;
		if (flag == 1) {
			cout << "CHEF\n";
			continue;
		}
		for (int i = 0; i < n; i++) ans += abs(a[i] - 2);
		if (ans % 2 == 1) cout << "CHEF\n";
		else cout << "CHEFINA\n";
	}
	return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?