void main() {
	const N = readInt;
	int[] A;
	{
		auto S = new bool[N + 1];
		foreach (i; 2 .. N + 1) {
			if (S[i]) continue;
			A ~= i;
			for (int j = i * 2; j <= N; j += i) S[j] = true;
		}
	}
	auto dp = new bool[N + 1];
	dp[0] = dp[1] = true;
	foreach (i; 2 .. N + 1) {
		bool now = false;
		foreach (j; 0 .. cast(int)(A.length)) if (A[j] <= i) {
			now = now || !dp[i - A[j]];
		}
		dp[i] = now;
	}
	writeln(dp[N] ? "Win" : "Lose");
}

import std,core.bitop;
string[]_R;
string readString(){while(_R.empty){_R=readln.chomp.split;}auto ret=_R.front;_R.popFront;return ret;}
int readInt(){return readString.to!int;}
long readLong(){return readString.to!long;}
ulong readULong(){return readString.to!ulong;}
real readReal(){return readString.to!real;}
bool chmin(T)(ref T A,T B){if(A>B){A=B;return true;}else{return false;}}
bool chmax(T)(ref T A,T B){if(A<B){A=B;return true;}else{return false;}}
int lowerBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<x?L:R)=mid;}return R;}
int upperBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<=x?L:R)=mid;}return R;}