import sys def eratosthenes(N): L = [True] * (N + 1) for i in range(2, int(N ** 0.5) + 1): if L[i]: for j in range(i * 2, N, i): L[j] = False return [i for i, b in enumerate(L[2:], 2) if b] def resolve(in_): N = int(next(in_)) primes = eratosthenes(N) dp = [False] * (N + 1) dp[0] = True dp[1] = True for n in range(2, N + 1): for prime in primes: p = n - prime if p < 0: break if dp[p] is False: dp[n] = True break return 'Win' if dp[N] else 'Lose' def main(): ans = resolve(sys.stdin.buffer) print(ans) if __name__ == '__main__': main()