#!/usr/bin/env python3
#fileencoding: utf-8

def is_prime(n,primes):
    for i in primes[1:]:
        if i > (n//2):
            break
        if n % i == 0:
            return False
    return True

# turn = 1 : me
# turn = 0 : Eve
memo = {}
def dfs(N,primes,turn):
    global memo
    if N == 2:
        result = False if turn == 1 else True
    elif N <= 1:
        result = True  if turn == 1 else False
    else:
        result = True
        for i in primes:
            diff = N - i
            if diff <= 1:
                break
            if (diff,turn) in memo:
                result = memo[(diff,turn)]
            else:
                result = dfs(diff, primes, turn ^ 1)
                memo[(diff,turn)] = result
            if result == False:
                break
    return result

def mk_cache(N):
    for i in range(1000,N,100):
        dfs(i,primes,1)

N = int(input())
primes = [2]
for i in range(3,N+1,2):
    if is_prime(i,primes):
        primes.append(i)

mk_cache(N)

if dfs(N,primes,1):
    print("Win")
else:
    print("Lose")