#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

struct Merge{
  set<vll> lr;
  ll INF = 1000000000000000009;
  vll remove(ll a, ll b){
    if(a>b) swap(a, b);
    auto itr = lr.lower_bound(vll{b+1, 0});
    if(itr==lr.begin()) return vll{a, b};
    itr--;
    ll lef = a, ri = b;
    while((*itr)[1]>=a){
      ll now_x = (*itr)[0], now_y = (*itr)[1];
      lef = min(lef, now_x), ri = max(ri, now_y);
      if(itr==lr.begin()){
        lr.erase(itr);
        break;
      }
      itr--;
      lr.erase(vll{now_x, now_y});
    }
    return vll{lef, ri};
  }
  void merge(ll a, ll b){lr.insert(remove(a, b));}

  vll get(ll a){
    auto itr = lr.lower_bound(vll{a+1, a+1});
    if(lr.size()==0||itr==lr.begin()) return vll{INF, INF};
    itr--;
    if((*itr)[1]<a) return vll{INF, INF};
    return *itr;
  }
  bool same(ll a, ll b){
    if(get(a)[0]==-1) return false;
    return get(a)[0]==get(b)[0];
  }
};
int main(int argc, char const *argv[]) {
  ll n;std::cin >> n;
  vll prm(10001, 1);
  prm[0] = prm[1] = 0;
  for(ll i=2;i<=10000;i++){
    if(!prm[i]) continue;
    for(ll j=i*i;j<=10000;j+=i) prm[j] = 0;
  }
  vll p;
  for(int i=2;i<=10000;i++) if(prm[i]) p.push_back(i);
  vll g(10001, 0);
  g[0] = g[1] = 1;

  for(int i=2;i<=n;i++){
    vll t;
    Merge mg;
    for(auto e:p) if(i-e>=0) mg.merge(g[i-e], g[i-e]+1);
    auto itr = mg.lr.begin();
    if((*itr)[0]!=0) g[i] = 0;
    else g[i] = (*itr)[1];
  }
  //for(int i=0;i<10;i++) std::cout << p[i] << " ";
  //std::cout << '\n';
  //for(int i=0;i<=n;i++) std::cout << g[i] << " ";
  //std::cout << '\n';
  std::cout << (g[n]?"Win":"Lose") << '\n';
}