anti-sg模板题

 题目链接：https://cn.vjudge.net/contest/281037#problem/B

T组数据，每组N堆石子，不能取的获胜。

John先手

#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define sec second
#define fir first
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define per(i,a,b) for(int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
int main() {
    freopen("a.txt","r",stdin);
    int T;
    cin>>T;
    while(T--) {
        int n;
        cin>>n;
        int sg = 0;
        int flag = 0;
        rep(i , 1, n) {
            int x;
            cin>>x;
            sg^=x;
            if(x>1) flag = 1;
        }
        if( (sg!=0&&flag)||(sg==0&&!flag) ) cout<<"John";
        else cout<<"Brother";
        cout<<endl;
    }
    return 0;
}