def primes(N): P = [] for i in range(2,N): sieve = 1 for p in P: if p*p > i: break elif i % p == 0: sieve = 0 break if sieve == 0: continue else: P.append(i) return P inpl = lambda: list(map(int,input().split())) N = int(input()) P = primes(N+1) dp = [True, True] for i in range(2, N+1): for p in P: if p >= i-1: dp.append(False) break elif not dp[i-p]: dp.append(True) break if dp[N]: print('Win') else: print('Lose')