#!/usr/bin/env python3
import sys
input = sys.stdin.readline

# O(nloglogn)
def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 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(n + 1) if is_prime[i]]

max_n = 10**4 + 10
n = int(input())
p = primes(max_n)

dp = [0] * (10**4 + 1)
dp[0] = 1
dp[1] = 1
for i in range(2, 10**4 + 1):
    index = 0
    prime = p[index]
    while prime <= i:
        if not dp[i - prime]:
            dp[i] = 1
            break
        index += 1
        prime = p[index]

if dp[n]:
    print("Win")
else:
    print("Lose")