#include <bits/stdc++.h>

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using usize = std::size_t;

const i32 INF = 1001001001;
const i64 LINF = 1001001001001001;
const u32 MOD1 = 1000000007;
const u32 MOD2 = 998244353;

i64 ntop(i64 x, i64 m) {
    if(x < 0) x += std::ceil((double)std::abs(x) / m) * m;
    return x % m;
}

i64 gcd(i64 a, i64 b) {
    return (b == 0 ? a : gcd(b, a % b));
}

i64 lcm(i64 a, i64 b) {
    if(a == 0 || b == 0) return -1;
    return a / gcd(a, b) * b;
}

i64 ext_gcd(i64 a, i64& x, i64 b, i64& y) {
    if(b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    i64 g = ext_gcd(b, y, a % b, x);
    y -= a / b * x;
    return g;
}

std::vector<std::pair<i64, i64>> prime_factor(i64 n) {
    std::vector<std::pair<i64, i64>> pf;
    i64 e = 0;
    while(n % 2 == 0) {
        e++;
        n /= 2;
    }
    if(e > 0) pf.emplace_back(std::make_pair(2, e));
    for(i64 i = 3; i * i <= n; i += 2) {
        e = 0;
        while(n % i == 0) {
            e++;
            n /= i;
        }
        if(e > 0) pf.emplace_back(std::make_pair(i, e));
    }
    if(n > 1) pf.emplace_back(std::make_pair(n, 1));
    return pf;
}

i64 euler_totient(i64 n) {
    std::vector<std::pair<i64, i64>> pf = prime_factor(n);
    i64 res = n;
    for(const auto& x : pf) {
        res -= res / x.first;
    }
    return res;
}

i64 linear_congruence_equation(i64 a, i64 c, i64 m) {
    i64 u, v;
    i64 g = ext_gcd(a, u, m, v);
    if(c % g != 0) return -1;
    i64 res = c / g * u % m;
    return ntop(res, m);
}

i64 chinese_remainder_theorem(i64 b, i64 m, i64 c, i64 n) {
    return m * linear_congruence_equation(m, ntop(c - b, n), n) + b;
}

using namespace std;

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    i64 n;
    cin>>n;
    i64 ans=1;
    for(i64 i=2;i<=n;i++){
        ans=lcm(ans,i);
    }
    cout<<ans+1<<endl;
}
#include <bits/stdc++.h>
using namespace std;
////////////////////////////////////////////////////////////////////////////<editor-fold desc="macros">
#define endl "\n"
#define long long long
#define all(v) (v).begin(),(v).end()
#define makeset(v) (v).resize(unique((v).begin(),(v).end())-(v).begin())
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define filein freopen("input.txt", "r", stdin);
#define fileout freopen("output.txt", "w", stdout);
#define getline(x) getline(cin,x)
#define makelower(s) transform(s.begin(),s.end(),s.begin(),::tolower)
bool sortby(pair<int,int> a,pair<int,int> b){
    double x=(double )a.first/a.second;
    double y=(double )b.first/b.second;
     return x<y;}
long Pow(long x, long y) {
    if(y == 0)return 1;
    long tmp=Pow(x,y/2);
    tmp*=tmp;
    if(y&1)tmp*=x;
    return tmp;
}
#define printcase(x)  cout<<"Case "<<in++<<": "<<x<<endl
#define memset(a,b) memset(a,b,sizeof(a))
#define print1d(ary) cout<<"[";for(auto x:(ary)){cout<<x<<",";}cout<<"]"<<endl;
#define print2d(x) for(int m = 0; m <sizeof(x)/sizeof(x[0]) ; ++m){for(int l = 0; l <sizeof(x[0])/sizeof(x[0][0]) ; ++l){cout<<x[m][l]<<" ";}cout<<endl;}
#define pi acos(-1)
#define esp 1e-9
////////////////////////////////////////////////////////////////////////////</editor-fold>

int main() {
///<editor-fold desc="ios">
    IOS
#ifdef _AD_
    filein //fileout
#endif
///</editor-fold>
    int in=1,o;
    long t,n,m,q,tmp;
    cin>>n;
    if(n&1)cout<<"Black"<<endl;
    else cout<<"White"<<endl;
}
