#include <bits/stdc++.h>
using namespace std;

int main() {
  int N;
  cin >> N;
  if ( N%2 == 1 ) {
    cout << "Black" << endl;
  }
  else {
    cout << "White" << endl;
  }
}
#include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_lr(i, f, n) for (int i = f; i < (int)(n); i++)
#define sum(v) accumulate(arr.begin(),arr.end(),0)
#define sumll(v) accumulate(arr.begin(),arr.end(),0LL)
#define maxe(v) *max_element(v.begin(),v.end())
#define mine(v) *min_element(v.begin(),v.end())
#define sorts(v) sort(v.begin(),v.end())
#define sortg(v) sort(v.begin(),v.end(),greater<int>)
using namespace std;

string replace_all(string &s, string from, string to) {
    ll pos = s.find(from);
    while(true){
        pos = s.find(from, pos);
        if(pos==-1) break;
        s.replace(pos, from.length(), to);
        pos += to.length();
    }
    return s;
}

int combination(int n, int r) {
    if(r < n) return 0;
    if(r*2 > n) r = n-r;
    int nume = 1;
    int deno = 1;
    rep_lr(i, 1, r+1) {
        nume *= (n-i+1);
        deno *= i;
    }
    return nume / deno;
}

int ceil(int nume, int deno){
    return (nume+deno-1)/deno;
}

template<typename T> 
void vinp(int n, T v){
    rep(i,n){
        cin >> v.at(i);
    }
}

void solve(){
    int N;
    cin >> N;
    cout << (N%2==0?"White":"Black") << endl;
}

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