#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <stack>
#include <vector>
#include <random>
#include <queue>
using namespace std;
typedef long long ll;
#define FOR(I,A,B) for(int I = int(A); I < int(B); ++I)

int memo[10001];
vector<int> p;
// 0 no decide  1lose  2win
// 負けの状態に行ける == 勝ち
int dfs(int x){
  if(memo[x])return memo[x];
  for(int i=0;p[i]<x;i++){
    if(dfs(x-p[i])==1){
      return memo[x] = 2;
    }
  }
  return memo[x] = 1;
}

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

int main(){
  memo[1] = memo[0] = 2;
  memo[2] = memo[3] = 1;
  for(int i=2;i<10001;i++){
    if(isp(i))p.push_back(i);
  }
  p.push_back(1000003);
  int n;
  cin >> n;
  cout << (dfs(n)==1?"Lose":"Win") << endl;
}