#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;
 
#define speed ios_base::sync_with_stdio(false),cout.tie(0),cin.tie(0)
#define fre freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
#define N 2*100005
#define M 2002
#define nd second
#define st first
#define endl "\n"
#define pii pair<ll,ll>
#define pb push_back
#define mp make_pair
#define inf 1e9+7
#define mid (start+end)/2
#define sp " "
typedef long long int ll;
 
string s;
 
void solve(){
    cin>>s;
    for (int i = 1; i < 3; ++i)
    {
        if(s[i]!=s[i-1]){
            cout<<"Lost";
            return;
        }
    }
    cout<<"Won";
}  
 
 
int main()
{
    speed;
    // fre;
    int TT=1;
    //cin>>TT;
    while(TT--)solve();
    return 0;
} 
using namespace std;
#include <bits/stdc++.h>

typedef long long ll;

map<int64_t, int> prime_factor(int64_t n)
{
    map<int64_t, int> ret;
    for (int64_t i = 2; i * i <= n; i++)
    {
        while (n % i == 0)
        {
            ret[i]++;
            n /= i;
        }
    }
    if (n != 1)
        ret[n] = 1;
    return ret;
}

int main()
{
    char a, b, c;
    cin >> a >> b >> c;
    if (a == b && a == c)
    {
        cout << "Won" << endl;
    }
    else
    {
        cout << "Lost" << endl;
    }

    return 0;
}