#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stack>
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <functional>
#include <numeric>
using ll = long long;
using namespace std;

const ll MOD = 1e9 + 7;
vector<int> prime;

bool sieve[200010];

int key[100010];
int Hash[55];
int main(void)
{
    int N;
    cin >> N;

    for (int i = 0; i < 10010; ++i)
        sieve[i] = true;

    sieve[0] = sieve[1] = false;

    for (int i = 2; i * i < 10010; ++i)
    {
        if (sieve[i])
        {
            for (int j = 2; i * j < 10010; ++j)
            {
                sieve[i * j] = false;
            }
        }
    }
    if (sieve[N - 2])
        cout << "Win" << endl;
    else
        cout << "No" << endl;
    return 0;
}