#!/usr/bin/env python3
# -*- coding: utf-8 -*-


import array
import math


def primes_by_eratosthenes(limit):
    """ Generate the sequence of prime numbers by Eratosthenes' method.

    :param limit: The maximum intenger (> 1) to be examined.
    :type limit: int
    :return: the sequence of prime numbers
    :rtype: an instance of :class:`array.array`

    """

    search_list = array.array("Q", range(2, limit + 1))
    primes = array.array("Q")
    while True:
        p = search_list.pop(0)
        primes.append(p)
        if p > math.sqrt(limit):
            break
        else:
            search_list = array.array("Q", filter(
                lambda x: x % p != 0, search_list))
    primes.extend(search_list)
    return primes


def judge(n):
    dp = array.array("B", [True, True])
    primes = primes_by_eratosthenes(n)
    for m in range(2, n + 1):
        for p in primes:
            if p > m:
                dp.append(False)
                break
            elif not dp[m - p]:
                dp.append(True)
                break
            else:
                continue
        else:
            dp.append(False)
    return dp[n]


if __name__ == "__main__":
    print("Win" if judge(int(input())) else "Lose")