/*The woods are lovely, dark and deep,
But I have promises to keep,
And miles to go before I sleep,
And miles to go before I sleep.*/

//PRABHJOT SINGH A.K.A. PRABHI
//~~~~~conquizztador~~~~~


#include<bits/stdc++.h>
using namespace std;
using lli = long long int;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int MOD = 1000000007;
const int MOD1 = 998244353;
const int maxn = 100010;
const int lim = (int)1e9;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n = 0; cin >> n; cout << ((n & 1) ? "Black" : "White") << endl;
}
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <cmath>

#define __AceOfSpades__ ios_base::sync_with_stdio(false); cin.tie(nullptr);
#define rep (i, n) for(int i=0; i<(n); i++)

typedef long long ll;
using namespace std;

int findSumOfDigits(int n){
  int digit = 0;
  while(n > 0){ 
    digit += n % 10;
    n /= 10;
  }
  return digit;
}
 
int main() {
  __AceOfSpades__

  int a;
  cin >> a;
  string ans;
  
  if (a%2==0) ans = "White";
  else ans = "Black";
  cout << ans << endl;
  
  return 0;

}
