# 1次元dp, dp[i] 数iで手番の人は勝つ1、負ける0
# 昇順で埋めていく
# 素数は最初に列挙する
# 10**5だが素数の数は少ないので2重ループで間に合うのでは

mx = 10000
is_prime = [1]*(mx + 1)
is_prime[0] = 0  
is_prime[1] = 0
for p in range(2, mx + 1):
    if is_prime[p]:
        for q in range(2*p, mx + 1, p):
            is_prime[q] = 0

primes = []
for i in range(mx):
    if is_prime[i] == 1:
        primes.append(i)
        
N = int(input())
dp = [0]*(N+1)
for i in range(4, N+1):
    for p in primes:
        if i-p < 2:
            break
        if dp[i-p] == 0:
            dp[i] = 1
            break
#print(dp)
    
if dp[N] == 1:
    print('Win')
else:
    print('Lose')