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

using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;

int main(void)
{
    ll n;

    cin >> n;

    if(n%2==0)
    {
        cout << "White" << endl;
    }
    else
    {
        cout << "Black" << endl;
    }

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
 
#define ff                          first
#define ss                          second
#define int                         long long
#define pb                          push_back
#define mp                          make_pair
#define pii                         pair<int,int>
#define vi                          vector<int>
#define omii                        map<int,int>
#define umii                        unordered_map<int,int>
#define pqi                         priority_queue<int>
#define pqd                         priority_queue<int,vi,greater<int> >
#define setbits(x)                  __builtin_popcountll(x)
#define zrobits(x)                  __builtin_ctzll(x)
#define mod                         1000000007
#define inf                         1e18
#define ps(x,y)                     fixed<<setprecision(y)<<x
#define mk(arr,n,type)              type *arr=new type[n];
#define tc(t)                       int t; cin>>t; while(t--)
#define fl(n)                       for(int i=0; i<n; i++)
#define twodvect(m,n, intit)        vector<vector<int>> v(m, vector<int>(n,0))
mt19937                             rng(chrono::steady_clock::now().time_since_epoch().count());
 
void c_p_c()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}
 
int32_t main()
{
    c_p_c();

    int n;
    cin>>n;
    if(n%2==0)
        cout<<"White"<<"\n";
    else cout<<"Black"<<"\n";        

    return 0;
}