#include <iostream>

using namespace std;
int main(){
  char a,b,c;
  cin >> a >> b >> c;
  if(a == b && b == c) cout << "Won" << endl;
  else cout << "Lost" << endl;
}
#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;
using cd = complex<double>;
#define ll long long
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LB lower_bound
#define UB upper_bound
#define sz(a) int((a).size())
#define REP(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define REPD(i, a, b) for (int i = (int)a - 1; i >= (int)b; i--)
#define VREP(it, v) for (auto it = v.begin(); it != v.end(); it++)
typedef pair<ll,ll> pi;
typedef vector<ll> vi;

const ll MOD = 1000000009;
const double PI = acos(-1);

template <typename T>
using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template <typename K, typename V>
using pbds_map = tree<K, V, less<K>, rb_tree_tag, tree_order_statistics_node_update>;
char a, b, c;
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> a >> b >> c;
	if (a == b && b == c) cout << "Won" << endl;
	else cout << "Lost" << endl;
}

//cout.flush()
//cout << fixed << setprecision(9) << x << endl;