#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int c[10010], memo[10010];
vector<int> p;

bool win(int n)
{
    if (n<2) return false;
    int& res=memo[n];
    if (~res) return res;
    for(int i=0;i<p.size()&&p[i]+1<n;++i)
        if (!win(n-p[i])) return res=true;
    return res=false;
}

int main()
{
    for(int i=2;i<10010;++i) if (!c[i]) {
        p.push_back(i);
        for(int j=i+i;j<10010;j+=i) c[j]=1;
    }

    int n;
    while (cin>>n) {
        memset(memo, -1, sizeof(memo));
        cout<<(win(n) ? "Win" : "Lose")<<endl;
    }
}