import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    N = int(input())

    ans = [False] * (10000 + 1)

    def get_primes(n):
        sieve = [1] * n
        for i in range(3, int(n ** 0.5) + 1, 2):
            if sieve[i]:
                sieve[i * i:: 2 * i] = [0] * ((n - i * i - 1) // (2 * i) + 1)
        return [2] + [i for i in range(3, n, 2) if sieve[i]]

    primes = get_primes(10000)
    primes.sort()

    ans[0] = True
    ans[1] = True

    for i in range(2, 10000 + 1):
        for prime in primes:
            if prime > i:
                break
            if not ans[i - prime]:
                ans[i] = True
                break

    if ans[N]:
        print("Win")
    else:
        print("Lose")


    

if __name__ == '__main__':
    main()