#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long pow1(long long a) {
  long long m = 1;
  for (long long i = 1; i <= a; i++) m *= 2;
  return m;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  for (long long i = 2; i < n; i++)
    if (n % i == 0) return false;
  return true;
}
int mod(string num, int a) {
  int res = 0;
  for (int i = 0; i < num.length(); i++) {
    res = (res * 10 + (int)num[i] - '0') % a;
    cout << res << endl;
  }
  return res;
}
long long modulo(long long a, long long b, long long n) {
  long long x = 1, y = a;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x * y) % n;
    }
    y = (y * y) % n;
    b /= 2;
  }
  return x % n;
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long h2(long long n) {
  long long res = 0;
  for (long long i = n; i >= 1; i--) {
    if ((i & (i - 1)) == 0) {
      res = i;
      break;
    }
  }
  return res;
}
long long pow2(long long n) {
  long long x = 1;
  for (long long i = 1; i <= n; i++) x *= 2;
  return x;
}
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  long long a, b;
  cin >> a >> b;
  long long w = abs(a - 1) + abs(b - 1);
  long long bf = abs(n - a) + abs(n - b);
  if (w <= bf)
    cout << "White" << endl;
  else
    cout << "Black" << endl;
}
