def sosu(N):
    nums = [n for n in range(2, N + 1)]
    i = 0
    while i <= len(nums) - 1:
        j = i + 1
        while j <= len(nums) - 1:
            if nums[j] % nums[i] == 0:
                nums.pop(j)
            else:
                j = j + 1
        i += 1
    return nums

def check(N):
    sosus = sosu(N)
    wins = [0, 1]
    for i in range(4, N + 1):
        for s in sosus:
            if (i - s) not in wins:
                wins.append(i)
                break
    if N in wins:
        return 'Win'
    else:
        return 'Lose'

if __name__ == '__main__':
    N = int(input())
    print(check(N))