import bisect,collections,itertools,math,functools,heapq
import sys
#sys.setrecursionlimit(10**6)
def I(): return int(sys.stdin.readline().rstrip())
def IN(): return int(input())
def LIN(): return list(map(int, input().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LF(): return list(map(float,sys.stdin.readline().rstrip().split()))
def SI(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

"""
方針
"""

n = 10**4
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
    primes.difference_update(range(i*2, n+1, i))

primes=sorted(primes)

N=I()
dp = [False]*(N+1)

for i in range(2, N):
    for v in primes:
        if i+v > N: break
        dp[i+v] = dp[i+v] or not dp[i]
if dp[N]:
    print('Win')
else:
    print('Lose')