#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
typedef vector<int> vi;
typedef vector<string> vs;
const int mod = 1000000007;
const int inf = 1061109567;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
signed main()
{
    int n;
    cin >> n;
    if(!(n%2)) cout << "White" << endl;
    else cout << "Black" << endl;
    return 0;
}
#include <iostream>
#include <set>
#include <cmath>

using namespace std;
int main(){
    long long int n,k; cin>>n;
    set<long long int> s;
    for(int a=2;a<=100000;a++){
        for(int b=2;b<=34;b++){
            k=pow(a,b);
            if(k>n) break;
            else s.insert(k);
        }
    }
    cout<<n-s.size()<<endl;

    return 0;
}