N = int(input()) memo = [-1] * (N+1) #-1 -> (not yet), 0 -> win, 1 -> Lose prime = [] memo[0] = 0 #0 -> win memo[1] = 0 #0 -> win #素数列を作る(=prime) for n in range(2,N+1): flag = True for m in range(2, n): if n%m == 0: flag = False break if flag: prime.append(n) def res(i): if memo[i] != -1: return(memo[i]) #計算済なら、それを返す flag = 1 for p in prime: if p < i: flag = flag * (1 - res(i-p)) memo[i] = flag #計算結果をmemoに入れる return(flag) if res(N) == 0: print("WIn") else: print("Lose")