#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define debug(x)      cerr << "L" << __LINE__ << ": " << #x << " = " << (x) << endl
#define debugvec(v)   rep(i, v.size()) cerr << "L" << __LINE__ << ": " << #v << "[" << i << "] = " << v[i] << endl;
#define debugvec2(v)  cerr << "L" << __LINE__ << ": " << #v << " = { "; rep(i, v.size()) cerr << v[i] << (i + 1 == v.size() ? "" : ", "); cerr << " }" << endl;
typedef long long ll;  /* 10^18 くらいまでいける */

int main(){
  char c1, c2, c3;
  cin >> c1 >> c2 >> c3;
  if (c1 == c2 && c2 == c3)
	cout << "Won" << endl;
  else
	cout << "Lost" << endl;
}

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
const int maxn=1e6+5;

int main(){
    char s[5];
    cin>>s+1;
    if(s[1]==s[2]&&s[3]==s[2]){
        cout<<"Won"<<endl;

    }
    else{
        cout<<"Lost"<<endl;
    }

    return 0;
}
