#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 <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN = 20000;
int Max[MAXN<<2];
int S[MAXN];
void build(int l,int r,int rt) {
    if(l == r) {
        Max[rt] = S[l];
        return ;
    }
    int m = (l+r)>>1;
    build(l,m,rt<<1);
    build(m+1,r,rt<<1|1);
    Max[rt] = max(Max[rt<<1],Max[rt<<1|1]);
}
int query(int L,int R,int l,int r,int rt) {
    if(l>=L && r<=R) {
        return Max[rt];
    }
    int m = (l+r)>>1;
    int Max = -1;
    if(L<=m) Max = max(Max,query(L,R,l,m,rt<<1));
    if(R > m) Max = max(Max,query(L,R,m+1,r,rt<<1|1));
    return Max;
}
int main() {
    int n;scanf("%d",&n);
    if(n%2==0) {
        cout<<"White"<<endl;
    }else {
        cout<<"Black"<<endl;
    }
    return 0;
}
