"""
Yukicoder No.7
author: yamaton
date: 2015-12-18
"""

import functools
import math
import sys


def sieve(n):
    remaining = [True] * (n + 1)
    max_p = int(math.sqrt(n))
    for p in range(2, max_p + 1):
        if not remaining[p]:
            continue
        for q in range(p * p, n + 1, p):
            remaining[q] = False
    return [p for p in range(2, n + 1) if remaining[p]]



@functools.lru_cache(maxsize=8096)
def solve(n):
    if n == 0 or n == 1:
        return True
    assert n >= 2
    return any(not solve(n-i) for i in sieve(n))


def tf_to_wl(tf):
    return 'Win' if tf else "Lose"


def pp(*args, **kwargs):
    return print(*args, file=sys.stderr, **kwargs)


def main():
    n = int(input())
    result = tf_to_wl(solve(n))
    print(result)


if __name__ == '__main__':
    main()