#include <bits/stdc++.h>
using namespace std;

#include  <ext/pb_ds/assoc_container.hpp>
#include  <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define x first
#define y second
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)

typedef long long ll;
typedef double db;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef pair<ll, ll> pll;


int solve()
{
	string s;
	if (!(cin >> s))
		return 1;
	
	set<char> has;
	FOR (i, 0, 5)
		has.insert(s[i]);
	FOR (i, 0, 7)
	{
		string g;
		cin >> g;
		if (g == s)
		{
			cout << "WINNER\n";
			return 0;
		}
		string resp = "";
		FOR (j, 0, 5)
		{
			if (g[j] == s[j])
				resp += 'G';
			else if (has.count(g[j]))
				resp += 'Y';
			else
				resp += 'X';
		}
		if (i != 6)
			cout << resp << '\n';
		else
			cout << "LOSER\n";
	}
	//cout << "LOSER\n";
	
	return 0;
}

int32_t main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int TET = 1;
	//cin >> TET;
	for (int i = 1; i <= TET; i++)
	{
		if (solve())
		{
			break;
		}
		#ifdef ONPC
			cerr << "_____________________________\n";
		#endif
	}
	#ifdef ONPC
		cerr << "\nfinished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n";
	#endif
	return 0;
}