#include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef vector vi; typedef vector vvi; #define rep(i,n) for(ll i=0;i<(n);i++) #define pii pair #define piii pair #define mp make_pair #define pb push_back #define ALL(a) (a).begin(),(a).end() #define FST first #define SEC second const int INF = (INT_MAX/2); const ll LLINF = (LLONG_MAX/2); const double eps = 1e-5; const double PI = M_PI; #define DEB cerr<<"!"< tii; bool wl[10001]; int main(){ int n; cin >> n; vi t ={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97}; priority_queue q; q.push(tii{0,0}); q.push(tii{1,0}); while(1){ int v = get<0>(q.top());int turn = get<1>(q.top()); q.pop(); if(v >= 10001 || wl[v] != 0) continue; wl[v]++; if(v == n) if(turn%2){cout << "Lose" << endl;return 0;} else{cout << "Win"<