#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<ll> a(n);
    ll k=0;
    for(int i=0;i<n;i++){
        cin >> a[i];
        int sum = 0;
        for(int j=2;j*j<=a[i];j++){
            while(a[i]%j==0){
                sum++;
                a[i]/=j;
            }
        }
        if(a[i]>1)sum++;
        k^=sum;
    }
    if(k){
        cout << "white" << endl;
    }
    else{
        cout << "black" << endl; 
    }
}