#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #if __has_include() #include using namespace atcoder; #endif #define GET_MACRO(_1, _2, _3, NAME, ...) NAME #define _rep(i, n) _rep2(i, 0, n) #define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++) #define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() using i64 = long long; template bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; } template bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; } templateistream& operator>>(istream&i,vector&v){rep(j,v.size())i>>v[j];return i;} templatestring join(vector&v){stringstream s;rep(i,v.size())s<<' '<ostream& operator<<(ostream&o,vector&v){if(v.size())o<string join(vector>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;} templateostream& operator<<(ostream&o,vector>&vv){if(vv.size())o< unordered_map factorize(T x) { unordered_map res; while(x % 2 == 0){ x >>= 1; res[2]++; } if(x == 1) return res; T i = 3; while(i * i <= x) { while(x % i == 0) { x /= i; res[i]++; } i += 2; } if(x != 1) res[x]++; return res; } int main(){ int n; cin >> n; vector a(n); cin >> a; int ans = 0; for (auto i: a){ int tmp = 0; auto x = factorize(i); for (auto [j, k]: x) tmp += k; ans ^= tmp; } cout << (ans? "white": "black") << endl; }