#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

const double EPS = 1e-10;
const double PI  = acos(-1.0);

#define CLR(a) memset((a), 0 ,sizeof(a))

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N;
	cin >> N;

	int r;
	REP(i, N){
		if(i * i > N){
			r = i;
			break;
		}
	}
	vector<int> vecP;
	vector<bool> p(N + 1, true);
	p[0] = p[1] = false;
	REP(i, N + 1){
		if(p[i]){
			vecP.push_back(i);
			for(int j = 2 * i; j <= N; j+= i){
				p[j] = false;
			}
		}
	}

	vector<bool> win(N, false);
	win[2] = win[3] = true;
	queue<int> que;
	que.push(2);
	que.push(3);

	while(!que.empty()){
		int tmp = que.front();
		que.pop();
		for(auto i:vecP){
			if(tmp + i <= N){
				win[tmp + i] = true;
				//cout << tmp << " " << i << endl;

			}
		}
	}
	if(win[N] == true) cout << "Win" << endl;
	else cout << "Lose" << endl;

	return 0;
}