from math import sqrt
from itertools import takewhile

def primes(n):
    if n < 1:
        return []

    is_prime = [True] * (n+1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, n+1):
        if not is_prime[i]:
            continue
        for j in range(i*2, n+1, i):
            is_prime[j] = False
    return [i for i in range(2, n+1) if is_prime[i]]

def main():
    """ main """
    N = int(input())
    prime_checker = [1]*(N+1)
    prime_list = set([])
    dp = set([0, 1])

    for i in range(2, N+1):
        if prime_checker[i]:
            prime_list.add(i)
            for j in range(i*2, N+1, i):
                prime_checker[j] = 0

        for j in prime_list:
            if i - j not in dp:
                dp.add(i)
                break

    print('Win' if N in dp else 'Lose')


main()