#include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    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; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)
    typedef long long ll;
    typedef long double ld;
    using P=pair<ll,ll>;
    const ld INF=1e18;
    const int mod=1e9+7;

    vector<pair<ll,ll>>prime_factorize(ll N) {
      vector<pair<ll,ll>>res;
      for (ll i= 2; i*i<=N;i++) {
        if (N%i!=0){continue;}
        ll cnt=0; 
        while(N%i==0){
          cnt++;
          N/=i;
        }
        res.push_back({i, cnt});
      }
      if(N!=1){res.push_back({N, 1});}
      return res;
    }

    void solve(){
        int n;
        cin>>n;
        vector<int>a(n);
        rep(i,n) cin>>a[i];
        map<int,int>mp;
        ll ans=0;
        rep(i,n){
            auto t=prime_factorize(a[i]);
            ll s=0;
            for(auto u:t){
                s+=u.second;
            }
            ans^=s;
        }
        if(ans){cout<<"white"<<endl;}
        else{cout<<"black"<<endl;}
    }  

    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        solve();
        
        return 0;
    }