#include <iostream>
#include <algorithm>
#include <vector>

#define REP(a,b) for(int a=0; a<(int)b; a++)

using namespace std;
int N;
vector <int> sosuu;

bool roop(int num, int turn){
  if(num == 0 || num == 1) return (turn == 1)? false : true;

  REP(i, sosuu.size()){
	if(turn == 0){
	  if(num-sosuu[i] < 0) return false;
	  if(roop(num-sosuu[i], turn^1)) return true;
	}else{
	  if(num-sosuu[i] < 0) return true;
	  if(!roop(num-sosuu[i], turn^1)) return false;
	}
  }
}


int main(){
  cin >> N;
  for(int i=2; i<=N; i++){
	bool flag = true;
	REP(j,sosuu.size()){
	  if(i%sosuu[j] == 0){ flag = false; break;}
	}
	if(flag) sosuu.push_back(i);
  }

  if(roop(N,0)) cout << "Win" << endl;
  else cout << "Lose" << endl;
  return 0;
}