#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <stack>
#include <array>
#include <fstream>
#include <deque>
#include <bitset>


#define REP(i,n) for(int (i) = 0;(i) < (n) ; ++(i))
#define REPS(a,i,n) for(int (i) = (a) ; (i) < (n) ; ++(i))
#if defined(_MSC_VER)||__cplusplus > 199711L
#define AUTO(r,v) auto r = (v)
#else
#define AUTO(r,v) typeof(v) r = (v)
#endif
#define ALL(c) (c).begin() , (c).end()
#define EACH(it,c) for(AUTO(it,(c).begin());it != (c).end();++it)
#define LL long long
#define int LL
#define INF  99999999
#define DIV 1000000007
#define QUICK_CIN ios::sync_with_stdio(false); cin.tie(0);
#define InitArr1(c,n) memset(&c[0],0,sizeof(int)*n)
#define InitArr2(c,n) memset(&c[0][0],0,sizeof(int)*n)

template<class T>
bool valid(T x, T w) { return 0 <= x&&x < w; }

int di[4] = { 1, -1, 0, 0 };
int dj[4] = { 0, 0, 1, -1 };

using namespace std;

//-----------------------------------------------------------------------------------------------
//-----------------------------------------------------------------------------------------------
//-----------------------------------------------------------------------------------------------


int n;
bool dp[10200];
vector<int> primes;
bool pri[10200];

signed main()
{
	QUICK_CIN;

		for (int i = 2; i*i <= 10199; ++i) {
			for (int j = 2 * i; j < 10200; j += i) {
				pri[j] = true;
			}
		}

		REP(i, 10197) {
			if (!pri[i+2]) {
				primes.push_back(i+2);
			}
		}

		while (cin >> n) {
			REP(i, 10200) {
				dp[i] = false;
			}
			dp[0] = dp[1] = true;

			for (int i = 2; i <= n;++i ) {
				for (auto x : primes) {
					if (i < x)break;
					dp[i] |= !dp[i - x];
				}
			}

			if (dp[n]) {
				cout << "Win" << endl;
			}
			else {
				cout << "Lose" << endl;
			}

		}

}