{.checks: off, optimization: speed.} import strutils, sequtils, algorithm let N = stdin.readline.parseInt var sieve = newSeq[bool](N+1) primes = newSeq[int]() for i in 2..N: if not sieve[i]: primes.add(i) for j in countup(2 * i, N, i): sieve[j] = true primes.reverse var dp = newSeqWith(N+1, -1) proc dfs(n: int): int = if n <= 1: return 1 elif dp[n] != -1: return dp[n] result = 0 for p in primes: if dfs(n-p) == 0: result = 1 break dp[n] = result echo(if dfs(N) == 1: "Win" else: "Lose")