#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()

int main(){
    int MAX_N = 1001;
    vector<bool> PNJudge(MAX_N,true);
    vector<int> pn;
    PNJudge[1] = false;
    for(int i=2;i<MAX_N;i++){
        if(!PNJudge[i]) continue;
        pn.push_back(i);
        for(int j=i*2;j<MAX_N;j+=i) PNJudge[j] = false;
    }
    int n;
    cin >> n;
    int nim = 0;
    rep(i,n){
        int a;
        cin >> a;
        int cnt = 0;
        for(int x:pn){
            if(a==1) break;
            while(!(a%x)){
                a /= x;
                cnt++;
            }
        }
        if(a!=1) cnt++;
        nim ^= cnt;
    }
    if(nim) cout << "white" << endl;
    else cout << "black" << endl;
    return 0;
}