#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
 
typedef pair<ll, ll> pl;
typedef pair<ld,ld> pd;
typedef vector<ll> vl;
// typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
 
#define G(x) ll x; cin >> x;
#define F(i, l, r) for (ll i = l; i < (r); ++i)
#define all(a) begin(a), end(a)
#define K first
#define V second
#define OK(i,j) i >= 0 && i < n && j >= 0 && j < m
 
#define NN 2505
#define MM 5005
#define MOD 1000000007

void solve() {

    string s;
    cin >> s;
    set<char> present;

    for(ll i=0;i<5;i++) present.insert(s[i]);
    bool solved = 0;
    string t;
    ll ct = 0;
    while(ct < 7) {
        cin >> t;
        if(s == t) {
            cout << "WINNER\n";
            solved = 1;
            break;
        }
        string out = "";
        for(ll i=0;i<5;i++) {
            if(s[i] == t[i]) out += 'G';
            else if(present.count(t[i]) > 0) out += 'Y';
            else out += 'X';
        }
        if(ct < 6) cout << out << '\n';

        ct++;
    }

    if(!solved) cout << "LOSER\n";

}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(10);

    solve();

    return 0;

}