#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (int i = (int)a; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF 1000000000
#define PI 3.14159265359
#define EPS 1e-12

bool pdp[10010];
int dp[10010];
vector<int> prime(){
	vector<int> ret;
	for (int i = 2; i < 10010; i++)
	{
		if (pdp[i]) continue;
		ret.push_back(i);
		for (int j = i + i; j < 10010; j += i)
		{
			pdp[j] = true;
		}
	}
	return ret;
}

int main(void)
{
  int n;
  cin >> n;
  auto p = prime();
  dp[0] = dp[1] = true;
  FOR(i, 2, n+1) {
    for(int j: p) {
      if(i - j < 0) break;
      dp[i] |= !dp[i-j];
    }
  }

  if(dp[n]) cout << "Win" << endl;
  else cout << "Lose" << endl;

  return 0;
}