#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = /*1'000'000'007LL;*/ 998'244'353LL;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
const int dy[4]={ -1,0,1,0 };
const int dx[4]={ 0,-1,0,1 };

int N;

signed main(){
	cin >> N;
	if(N%2 == 0) cout << "White" << endl;
	else cout << "Black" << endl;
}
// @includes_template
#ifndef INCLUDES_H
#define INCLUDES_H


#include<iostream>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<string>


#define s64i              long long
#define u64i              unsigned long long
#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define uniq(v)           (v).erase(unique(all(v)),(v).end())
// #define sz(x)             (int)((x).size())
#define ff                first
#define ss                second
#define pii               pair<int,int>
#define ffloop(i,a,b,step)        for(int i=a;i<b;i+=step)
#define bfloop(i,a,b,step)        for(int i=a;i>b;i-=step)
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))

template<typename T,typename T1>T amax(T &a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T amin(T &a,T1 b){if(b<a)a=b;return a;}

using namespace std;


#endif

// @contest_template
#include<algorithm>
namespace contest_ns{
    void solve(){
        /**
         * new code goes here
         */
        int x,y;
        cin>>x>>y;
        if(x == 0 && (y ==0)){
            cout<<0<<endl;
        }else if(x == 0 && y==1){
            cout<<2<<endl;
        }else if(x == 0 && y==2){
            cout<<1<<endl;
        }else if((x == 1) && (y == 0)){
            cout<<2<<endl;
        }else if(x == 1 && y == 1){
            cout<<1<<endl;
        }else if(x == 1 && y == 2){
            cout<<0<<endl;
        }else if(x == 2 && y == 0){
            cout<<1<<endl;
        }else if(x == 2 && y == 1){
            cout<<0<<endl;
        }else if(x == 2 && y == 2){
            cout<<2<<endl;
        }
    }
    // template<typename T>
    void testcase(){
        // T t;
        long long int t;
        std::cin>>t;
        while(t>0){
            solve();
            t--;
        }
    }
}

int main(){
    
    // @problem code
    
    
    contest_ns::solve();    
    

    return 0;
}

