#include<iostream>
#include<vector>
#include<cmath>

using namespace std;

#define NMAX 10000
#define WIN 1
#define LOSE 0
#define NOT -1

int main(){

	vector<int> sosuu;
	int hurui[NMAX+1];
	int K,N;
	int wl[NMAX+1];

	for(int i=0;i<=NMAX;i++) hurui[i]=0;
	hurui[0]=1,hurui[1]=1;

	for(int i=0;i<=NMAX;i++){
		if(hurui[i]==0){
			sosuu.push_back(i);
			for(int j=i*2;j<NMAX;j+=i) hurui[j]=1;
		}
	}

	for(int i=0;i<=NMAX;i++) wl[i]=NOT;

	wl[2]=LOSE;
	wl[3]=LOSE;

	while(1){
		bool f=true;
		for(int i=2;i<=NMAX;i++){
			if(wl[i]==NOT) f=false;
		}
		if(f) break;
		for(int i=2;i<=NMAX;i++){
			if(wl[i]!=NOT){
				for(int j=0;j<sosuu.size();j++){
					if(i+sosuu[j]<=NMAX){
						if(wl[i]==LOSE) wl[i+sosuu[j]]=WIN;
						if(wl[i]==WIN&&wl[i+sosuu[j]]!=WIN) wl[i+sosuu[j]]=LOSE;
					}
				}
			}
		}
	}

	cin>>N;

	if(wl[N]==WIN) cout<<"WIN"<<endl;
	else cout<<"LOSE"<<endl;
}