#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[8]={1,0,-1,0,1,1,-1,-1}; const ll dx[8]={0,1,0,-1,1,-1,1,-1}; template inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } class osak{ vector res; public: vector prime; osak(long long n){//sieve(n),O(N); res=vector(n); iota(res.begin(), res.end(), 0); for (int i = 2; i*i < n; ++i) { if (res[i] < i) continue; for (int j = i*i; j < n; j += i) if (res[j] == j) res[j] = i; } for(int i = 2; i < n; ++i){ if(res[i]==i)prime.emplace_back(i); } } map factor(int n) { map factor; while (n > 1) { factor[res[n]]++; n /= res[n]; } return factor; } vector divisor(int N){//O(div.size()) map facs=factor(N); vector ret={1}; for(auto p:facs){ ll range=ret.size(); ll now=1; for(int i=0;i> n; osak os(1e6+10); ll ans=0; rep(i,n){ ll a;cin >> a; ll ret=0; for(auto [hog,val]:os.factor(a)){ ret+=val; } ans^=ret; } if(ans)cout << "White" << endl; else cout << "Black" << endl; }