#line 1 "main.cpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define FOR(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
int popcount(int x) { return __builtin_popcount(x); }
ll popcount(ll x) { return __builtin_popcountll(x); }
#pragma endregion Macros

#line 1 "/home/siro53/kyo-pro/compro_library/math/osa_k.hpp"
// https://qiita.com/rsk0315_h4x/items/ff3b542a4468679fb409
class osa_k {
  private:
    int N;
    vector<int> min_factor;

  public:
    osa_k(int N) : N(N), min_factor(N) {
        iota(ALL(min_factor), 0);
        for(int i = 2; i * i < N; i++) {
            if(min_factor[i] < i) continue;
            for(int j = i * i; j < N; j += i) {
                if(min_factor[j] == j) min_factor[j] = i;
            }
        }
    }
    
    vector<int> factor(int n) {
        vector<int> res;
        while(n > 1) {
            res.push_back(min_factor[n]);
            n /= min_factor[n];
        }
        return res;
    }
};
#line 72 "main.cpp"

osa_k f(1000000 + 10);

int main() {
    int N;
    cin >> N;
    int g = 0;
    REP(i, N) {
        int a;
        cin >> a;
        auto v = f.factor(a);
        g ^= (int)v.size();
    }
    cout << (g != 0 ? "white" : "black") << endl;
}