using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
using static System.Math;

class Program
{
    static void Main()
    {
        var N = int.Parse(ReadLine());
        var p = new bool[N + 1];
        for (int i = 0; i < p.Length; i++)
        {
            p[i] = IsPrime(i);
        }
        var dp = new int[N + 1];
        for (int i = 4; i < dp.Length; i++)
        {
            var l = new SortedSet<int>();
            for (int j = 2; j < i-1; j++)
            {
                if (p[j])
                {
                    l.Add(dp[i - j]);
                }
            }
            var c = 0;
            foreach (var a in l)
            {
                if (a != c)
                {
                    dp[i] = c;
                    break;
                }
                c++;
            }
            if (c == l.Count) dp[i] = c;
        }
        WriteLine(dp[N] == 0 ? "Lose" : "Win");
    }

    static bool IsPrime(int n)
    {
        if (n < 2) return false;
        if (n == 2) return true;
        if (n % 2 == 0) return false;
        for (int i = 2; i * i <= n; i++)
        {
            if (n % i == 0) return false;
        }
        return true;
    }
}