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):
    nums = [n for n in range(2, N + 1)]
    sosus = sosu(N)
    for i in range(len(nums)):
        if nums[i] != -1:
            for s in sosus:
                if i + s < N - 1:
                    nums[i + s] = -1
        else:
            continue
        if nums[-1] == -1:
            return 'Win'
    return 'Lose'

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