import sys
import time
sys.setrecursionlimit(1 << 30)
N = input()
dp = [-1 for i in range(10010)]
prime = [True for i in range(10010)]
def sieve():
    prime[0] = False
    prime[1] = False
    for i in range(2, 10010):
        if (prime[i]):
            for j in range(i * i, 10010, i):
                prime[j] = False


def memo(pos):
    if (pos == 0 or pos == 1):
        return True
    win = False
    if (dp[pos] >= 0):
        return dp[pos]
    for i in range(2, pos):
        if (prime[i]):
            win |= not memo(pos - i)
            if (win):
                break
    dp[pos] = win
    return win

sieve()
if (memo(N)):
    print "Win"
else:
    print "Lose"