#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

vector<int> Eratosthenes(int N){
    vector<int> res, p(N + 1, 1); p[0] = p[1] = 0;
    for(int i = 0; i < N; i++) if(p[i]) {
        for(int j = i + i; j <= N; j += i) p[j] = 0;
    }
    for(int i = 0; i <= N; i++) if(p[i]) res.emplace_back(i);
    return res;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N; cin >> N;
    vector<int> dp(N + 1, 0), primes = Eratosthenes(N);
    enum{ LOSE, WIN };

    dp[0] = dp[1] = WIN;
    for(int i = 2; i <= N; i++) {
        for(int p : primes) {
            if(p <= i && dp[i - p] == LOSE) {
                dp[i] = WIN;
                break;
            } 
        }
    }

    cout << (dp[N] == WIN ? "Win" : "Lose") << endl;
}