from math import sqrt

class Yukicoder:
    def __init__(self):
        self.n = int(input())

    def run(self):
        dp = set([0,1])
        primes = set([])
        for i in range(2, self.n + 1):
            if self.prime_check(i):
                primes.add(i)
            for j in primes:
                if (i - j) not in dp:
                    dp.add(i)
                    break
        if self.n in dp:
            return "Win"
        else:
            return "Lose"

    
    def prime_check(self, n):
        if n < 2:
            return False
        else:
            i = 2
            while i <= sqrt(n):
                if n % i == 0:
                    return False
                i += 1
            return True


y = Yukicoder()
print(y.run())