#!/usr/bin/env python3
#fileencoding: utf-8

def is_prime(n,primes):
    for i in primes[1:]:
        if i > (n//2):
            break
        if n % i == 0:
            return False
    return True

N = int(input())
primes = [2]
for i in range(3,N+1,2):
    if is_prime(i,primes):
        primes.append(i)

memo = [0] * 10001
memo[0] = memo[1] = 1
for i in range(2,N+1):
    for p in primes:
        if p > i:
            break
        elif memo[i-p] == 0:
            memo[i] = 1
            break
print("Win" if memo[0] == 1 else "Lose")