#include <bits/stdc++.h>

using namespace std;

#define LOG(...) fprintf(stderr,__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

bool sieve[10001];
bool dp[10001];

int main() {
    int n;
    cin >> n;

    int primes = 0;

    sieve[0] = sieve[1] = true;
    FOR(i, 2, n) {
        if (sieve[i]) continue;
        primes++;
        for (int j = i + i; j < n; j += i) {
            sieve[j] = true;
        }
    }

    /* 0 1 2 3 4 5 6 7 8 9 10 11 12
     * O O X X O O O O O O  O  X  X
     */

    dp[0] = dp[1] = true;
    FOR(i, 2, n+1) {
        for (int j = i; j >= 2; j--) {
            if (sieve[j]) continue;
            if (!dp[i-j]) {
                dp[i] = true;
                break;
            }
        }
    }

    cout << (dp[n] ? "Win" : "Lose") << endl;
}