using System;
using System.Linq;

namespace PrimeNumberGame_CS
{
    class Program
    {
        static void Main(string[] args)
        {
            Solver sol = new Solver();
            Console.WriteLine(sol.Solve() ? "Win" : "Lose");
        }
    }

    class Solver
    {
        int[] PrimeNumber;
        int N;
        bool[] WL;

        public bool Solve()
        {
            if (N <= 3) return false;
            PrimeNumber = SieveOfEratosthenes(N - 2);
            for (int i = 4; i <= N; i++)
            {
                WL[i] = PrimeNumber.Any(n => (n <= i - 2) && !WL[i - n]);
            }
            return WL[N];
        }

        public Solver()
        {
            N = ri();
            WL = new bool[N + 1];
        }

        static String rs() { return Console.ReadLine(); }
        static int ri() { return int.Parse(Console.ReadLine()); }
        static long rl() { return long.Parse(Console.ReadLine()); }
        static double rd() { return double.Parse(Console.ReadLine()); }
        static String[] rsa() { return Console.ReadLine().Split(' '); }
        static int[] ria() { return Console.ReadLine().Split(' ').Select(e => int.Parse(e)).ToArray(); }
        static long[] rla() { return Console.ReadLine().Split(' ').Select(e => long.Parse(e)).ToArray(); }
        static double[] rda() { return Console.ReadLine().Split(' ').Select(e => double.Parse(e)).ToArray(); }

        /* max以下の素数の配列を返す (max は1以上)*/
        public int[] SieveOfEratosthenes(int max)
        {
            bool[] is_prime = new bool[max + 1];
            int cur;
            for (int i = 2; i < is_prime.Length; i++)
            {
                is_prime[i] = true;
            }
            for (cur = 2; cur < is_prime.Length; cur++)
            {
                if (!is_prime[cur]) continue;
                for (int nc = cur * 2; nc <= max; nc += cur)
                {
                    is_prime[nc] = false;
                }
            }
            return Enumerable.Range(2, max - 1).Where(e => is_prime[e]).ToArray();
        }
    }
}