#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <math.h>
#include <set>
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define P pair<int, int>

#define MOD 1000000007
#define INF 1012345678
#define NINF (-2147483647-1)
#define LLINF 9223372036854775807
using ll = long long;
using namespace std;

int main() {
    int N;
    cin >> N;
    // A = 0のときLose, A = 1のときWin
    vector<int> A(N+1, -1);
    A[0] = A[1] = 1;
    vector<bool> isprime(N + 1, true);
    vector<int> prime;
    // エラトステネスの篩
    for (int i = 2; i*i <= N; i++)
    {
        if (isprime[i]) {
            for (int j = i + i; j <= N; j += i)
            {
                isprime[j] = false;
            }
        }
    }
    for (int i = 2; i < N; i++)
    {
        if (isprime[i]) {
            prime.push_back(i);
        }
    }
    for (int i = 0; i <= N; i++)
    {
        for (int j = 0; j < prime.size(); j++)
        {
            if (i + prime[j] <= N) {
                if (A[i + prime[j]] < 0 || A[i] == 0) {
                    A[i + prime[j]] = 1 - A[i];
                }
            }
            else {
                break;
            }
        }
    }
    if (A[N] == 1) {
        cout << "Win" << endl;
    }
    else if (A[N] == 0) {
        cout << "Lose" << endl;
    }
    else {
        cout << "error" << endl;
    }
    getchar(); getchar();
    return 0;
}