def prime_ls(n):
    ls = [i for i in range(2, n + 1) if i == 2 or not i % 2 == 0]
    for i in range(3, int(n**0.5) + 1, 2):
        ls = [j for j in ls if j == i or not j % i == 0]
    return ls

n = int(input())

p_ls = prime_ls(n)
gr = [0] * (n + 1)
for i in range(4, n + 1):
    s = []
    for p in p_ls:
        if i - p < 2:
            break
        s.append(gr[i - p])
    for j in range(i):
        if not j in s:
            gr[i] = j
            break
if gr[n] == 0:
    print('Lose')
else:
    print('Win')