n = int(input())

from math import floor
from math import sqrt

def isprime(n):
    if n == 1:
        return False
    if n == 2:
        return True
    if n%2 == 0:
        return False
    for i in range(3, floor(sqrt(n))+1, 2):
        if i != n and n%i == 0:
            return False
    return True

def primes(n):
    p = []
    for i in range(n):
        if isprime(i):
            p.append(i)
    return p

p = primes(n)

np = len(p)
d = []
for i in range(np+1):
    r = [None] * (n+1)
    d.append(r)

d[0][n] = 0
for i in range(np):
    for j in reversed(range(n+1)):
        if d[i][j] != None:
            d[i+1][j-p[i]] = True
            d[i+1][j] = True

results = []
if d[np][0]:
    for i in reversed(range(np+1)):
        if d[i][0] == None:
            results.append(i+1)
            break
        
if d[np][1]:
    for i in reversed(range(np+1)):
        if d[i][1] == None:
            results.append(i+1)
            break

win = True
for result in range(len(results)):
    if result%2 != 0:
        win = False
    
print('Win' if win else 'Lose')