import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
from collections import Counter, deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

N=int(readline())
P=[]
for i in range(2,10000):
    for p in P:
        if i%p==0:
            break
    else:
        P.append(i)
dp=[False]*(N+1)
dp[0]=True
dp[1]=True
for n in range(2,N+1):
    for p in P:
        if n<p:
            continue
        if dp[n-p]==False:
            dp[n]=True
if dp[N]:
    ans='Win'
else:
    ans='Lose'
print(ans)