#include <bits/stdc++.h>

const int N = 1e6 + 50;
int n;
int cnt[30];
char s[N], t[N];

bool solve()
{
	if (cnt[25] % 3 != 2)
	{
		if (cnt[25] == n)return false;
		else return true;
	}
	else
	{
		if (cnt[25] == n - 1)
		{
			for (int j = 0; j < 25; j++)
			{
				if (cnt[j] > 0)
				{
					if ((26 - j) % 3 == 0)return true;
					else return false;
				}
			}
		}
		else return true;
	}
	throw;
}
template <long long T>
struct fast_io
{
	char p[T], q[T], * p1, * p2, * q1, * q2;
	fast_io()
	{
		p1 = p2 = p;
		q1 = q, q2 = q + T;
	}
	inline char gc()
	{
		return p1 == p2 && (p2 = (p1 = p) + fread(p, 1, T, stdin), p1 == p2) ? EOF : *p1++;
	}
	inline void pc(char c)
	{
		if (q1 == q2) q2 = (q1 = q) + fwrite(q, 1, T, stdout);
		*q1++ = c;
	}
	~fast_io()
	{
		fwrite(q, 1, q1 - q, stdout);
	}
};
fast_io<1 << 20> io;
inline long long read()
{
	long long res = 0;
	char ch;
	do ch = io.gc(); while (ch < 48 || ch > 57);
	do res = res * 10 + ch - 48, ch = io.gc(); while (ch >= 48 && ch <= 57);
	return res;
}
inline void read(char *s)
{
	char ch;
	do ch = io.gc(); while (!isalpha(ch) && ch != '-');
	do *s++ = ch, ch = io.gc(); while (isalpha(ch) || ch == '-');
}
inline void put(int64_t x)
{
	if (x < 0) io.pc('-'), x = -x;
	if (x >= 10) put(x / 10);
	io.pc(48 + x % 10);
}
inline void output(int64_t x, char ch = ' ')
{
	put(x);
	io.pc(ch);
}
int main()
{
	n = read();
	read(t);
	read(s);
	for (int i = 0; i < n; ++i)
		++cnt[s[i] - 'a'];
	if (t[0] == 'O')
	{
		if (solve())puts("Lose");
		else puts("Win");
	}
	else
	{
		if (n == 1)
		{
			puts("Win");
			return 0;
		}
		bool ret = true;
		for (int i = 0; i < 26; ++i)
		{
			if (cnt[i] == 0)continue;
			cnt[i]--;
			n--;
			ret &= solve();
			if (i == 25)break;
			cnt[i + 1]++;
			n++;
			ret &= solve();
			cnt[i]++;
			cnt[i + 1]--;
		}
		if (ret)puts("Lose");
		else puts("Win");
	}
}