//remove #define int long long in critical cases to avoid TLE
//always use ll with constants like (1ll)<<59 otherwise ans will be zero at higher cases
//while doing question on comparing, sort elements according to the difference they produce
//when elements are unique sorting elements after inserting in vector sometimes gives TLE but inserting in set 
//can help 
//prefer set over map for checking presence. Map may give TLE more earlier than Sets && set::find over set::count
//even if computation takes O(logn) time in sets prefer deleting elements as soon their use is over. Reduces chances of TLE
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ff first
#define ss second
#define vi vector <int>
#define pii pair<int,int>
#define f(x,y,z) for(x=y;x<z;x++)
#define pb push_back
#define mp make_pair
#define ld long double
#define ps(x,y) fixed << setprecision(y) << x
#define PI 3.1415926535
#define mod 1000000007 
#define mods 998244353 
#define setbits(x) __builtin_popcountll(x)
#define all(x) (x).begin(), (x).end()
#define fill(a,b) memset(a,b,sizeof(a))
#define INF INT_MAX


// AUTHOR ALOK KUMAR
int lcm(int a,int b)
{
    return (a*b)/(__gcd(a,b));
}
int power(int a,int b,int p)
{
    int c=1;
    while(b)
    {
        if(b&1)
        c*=a;
        a*=a;
        b>>=1;
        c%=p;
        a%=p;
        b%=p;
    }
    return c%p;
}
int inverse_mod(int n, int p)
{
    return power(n,p-2,p);
}
void seive()
{
    int N;
    int prime[N+1];
    int i;
    for(i=2;i*i<=N;i++)
    {
        if(!prime[i])
        {
            for(int j=i*i;j<=N;j+=i)
            {
                prime[j] = 1;
            }
        }
    }
}

void solve()
{
    char ch1,ch2,ch3;
    cin>>ch1>>ch2>>ch3;
    if(ch1==ch2&&ch2==ch3)
    cout<<"Won\n";
    else
    cout<<"Lost\n";
    
}



int32_t main()
{
    IOS
    int t=1;
   // cin>>t;
    while(t--)
    solve();
    return 0;
}





























































#include <bits/stdc++.h>
using namespace std;
#define fast_io cin.tie(0);ios_base::sync_with_stdio(0);
string to_string(string s) { return '"' + s + '"';}
string to_string(char s) { return string(1, s);}
string to_string(const char* s) { return to_string((string) s);}
string to_string(bool b) { return (b ? "true" : "false");}
template <typename A> string to_string(A);
template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}
template <typename A> string to_string(A v) {bool f = 1; string r = "{"; for (const auto &x : v) {if (!f)r += ", "; f = 0; r += to_string(x);} return r + "}";}
void debug_out() { cout << endl; }
void show() { cout << endl; }
void pret() { cout << endl; exit(0);}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {cout << " " << to_string(H); debug_out(T...);}
template <typename Head, typename... Tail> void show(Head H, Tail... T) {cout <<H<<" "; show(T...);}
template <typename Head, typename... Tail> void pret(Head H, Tail... T) {cout <<H<<" "; pret(T...);}
#define pr(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
typedef long long ll;
#define int ll
typedef long double ld;
typedef vector<int> vi;
#define disp(x) cout<<x<<" ";
#define rep(i,a,b) for(int i=a;i<(int)b;i++)
#define fo(i,a,b) for(int i=a;i<=(int)b;i++)
#define rf(i,a,b) for(int i=a;i>=(int)b;i--)
#define mp make_pair
#define pb emplace_back
#define F first
#define S second
#define endl '\n'
//cout.setf(ios::fixed);cout.precision(18)
const int MOD = 1e9+7;
const int maxn = 300000+10;

int32_t main(){
    fast_io;
    string s;
    cin >> s;
    if(s[1] != s[0] or s[2] != s[0]){
    	pret("Lost");
    }
    else {
    	show("Won");
    }
    return 0;
}