// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000005
#define inf 0x3f3f3f3f

int cnt[38],n;
bool chk(){
	if(cnt[25]==n) return cnt[25]%3==2;
	if(cnt[25]<n-1) return 1;
	assert(cnt[25]==n-1);
	if((n-1)%3!=2) return 1;
	For(j,0,24)
		if(cnt[j]) return (26-j)%3==0;
	assert(0);
}

char s[maxn];
string opt;

signed main()
{
	cin>>n>>opt>>s;
	For(i,0,n-1) ++cnt[s[i]-'a'];
	if(opt[0]=='O'){
		if(chk())puts("Lose");
		else puts("Win");
		return 0;
	}
	if(n==1){
		puts("Win");
		return 0;
	}
	For(i,0,25){
		if(cnt[i]){
			--cnt[i],--n;
			if(!chk())puts("Win"),exit(0);
			++cnt[i],++n;
			if(i!=25){
				--cnt[i],++cnt[i+1];
				if(!chk())puts("Win"),exit(0);
				++cnt[i],--cnt[i+1];
			}
		}
	}
	puts("Lose");
	return 0;
}