#include <iostream>
using namespace std;


int main()
{
	int n;
	cin>>n;
	if(n%2!=0)
	{
		cout<<"Black";
	}
	else{
		cout<<"White";
	}
	return 0;
	
}
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>

#define REP(i, n) for(int i = 0; i < n; ++i)
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;

// 素因数分解:O(sqrt(N))
const map<LLONG, LLONG> PrimeFactorize(LLONG N)
{
    map<LLONG, LLONG> prime2NumMap;
    for (LLONG p = 2; p * p <= N; ++p)
    {
        if (N % p != 0) continue;
        while (N % p == 0)
        {
            N /= p;
            ++prime2NumMap[p];
        }
    }
    if (N != 1) prime2NumMap[N] = 1;
    return prime2NumMap;
}

int main()
{
	int N; cin >> N;
	REP(ai, N)
	{
		int num = 0;
		for (const auto& kvp : PrimeFactorize(ai + 1))
		{
			num += kvp.second;
		}
		cout << num + 1 << ' ';
	}
}
