#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    int N;
    cin >> N;
    int A[10000] = {0};
    vector<int> P;
    for ( int i = 2; i <= N; i++ ) {
        if ( !A[i] ) {
            P.push_back(i);
            for ( int j = 2; i*j <= N; j++ ) {
                A[i*j] = 1;
            }
        }
    }
    
    
    vector<int> W(N+1, 0);
    W[2] = W[3] = 0;
    for ( int i = 4; i <= N; i++ ) {        
        for ( int j = 0; j < P.size() && i-P[j] > 1; j++ ) {
            if ( !W[i-P[j]] ) { W[i] = 1; break; }
        }
    }
    
    // for ( int i = 2; i <= N; i++ ) {
        // cout << W[i] <<endl;
    // }
    
    cout << ( W[N] ? "Win" : "Lose" ) << endl;
    
    
    return 0;
}