#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

const int inf = 1LL<<60;
const int mod = 1e9 + 7;
const double eps = 1e-9;

/*{
}*/

signed main()
{
  int n;
  cin >> n;

  vector<bool> p(n+1, true);
  p[0] = p[1] = false;
  repi(i, 2, n+1) repi(j, 2, n/i+1){
    p[i*j] = false;
  }

  vi prime;
  rep(i, n+1){
    if(p[i]) prime.pb(i);
  }

  vector<bool> win(n+1);
  win[0] = win[1] = true; 
  repi(i, 2, n+1){
      bool flag = false;
      rep(j, prime.size()){
        if(i-prime[j] < 0) break; 
        if(!win[i-prime[j]]) flag = true;
      }
      win[i] = flag;
  }

  cout << (win[n] ? "Win" : "Lose") << endl;

  return 0;
}