using System; using System.Collections; using System.Collections.Generic; using System.IO; using System.Linq; using System.Numerics; using System.Text; using static System.Console; using static System.Convert; using static System.Math; using static Extentions; class IO { int idx; string[] input; public IO(TextReader reader) { input = reader.ReadToEnd().Split(new[] { " ", Environment.NewLine }, StringSplitOptions.RemoveEmptyEntries); } T Get(Func parser) => parser(input[idx++]); public string S => Get(s => s); public char C => Get(char.Parse); public int I => Get(int.Parse); public long L => Get(long.Parse); public double F => Get(double.Parse); public decimal D => Get(decimal.Parse); public BigInteger B => Get(BigInteger.Parse); T[] Gets(int n, Func parser) => input.Skip((idx += n) - n).Take(n).Select(parser).ToArray(); public string[] Ss(int n) => Gets(n, s => s); public char[] Cs(int n) => Gets(n, char.Parse); public int[] Is(int n) => Gets(n, int.Parse); public long[] Ls(int n) => Gets(n, long.Parse); public double[] Fs(int n) => Gets(n, double.Parse); public decimal[] Ds(int n) => Gets(n, decimal.Parse); public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse); public void Write(params T[] xs) => WriteLine(string.Join(" ", xs)); public void Write(params object[] xs) => WriteLine(string.Join(" ", xs)); } static class Extentions { public static int[] GetPrimes(int n) { var flgs = new bool[n + 1]; for (var i = 3; i * i < n; i += 2) if (!flgs[i]) for (var j = i * i; j <= n; j += i) flgs[j] = true; var list = new List() { 2 }; for (var i = 3; i <= n; i += 2) if (!flgs[i]) list.Add(i); return list.ToArray(); } public static int ToInt(this bool x) => ToInt32(x); } static class Program { public static void Main() { #if !DEBUG SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false }); #endif Solve(new IO(In)); Out.Flush(); } static int[] ps; static bool?[,] dp; static bool Search(bool turn, int n) { if (dp[turn.ToInt(), n].HasValue) return dp[turn.ToInt(), n].Value; if (n <= 1) return (dp[turn.ToInt(), n] = true).Value; foreach (var p in ps.Where(x => x <= n)) if (!Search(!turn, n - p)) return (dp[turn.ToInt(), n] = true).Value; return (dp[turn.ToInt(), n] = false).Value; } static void Solve(IO io) { var n = io.I; ps = GetPrimes(n); dp = new bool?[2, n + 1]; io.Write(Search(true, n) ? "Win" : "Lose"); } }