from math import sqrt

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())

    if N < 4:
        print('Lose')
        return

    ps = primes(N)
    dp = [None] * (N+1)
    dp[0] = True
    dp[1] = True
    dp[2] = False
    dp[3] = False
    for i in range(4, N+1):
        if all([dp[i-j] for j in ps if j <= i]):
            dp[i] = False
        else:
            dp[i] = True

    print('Win' if dp[N] else 'Lose')


main()