#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
#include <utility>
#include <numeric>

using namespace std;

int main(){

    string s;
    cin >> s;
    if(s[0] == s[1] && s[1] == s[2]){
        cout << "Won" << endl;
    }
    else{
        cout << "Lost" << endl;
    }

    return 0;
}
// @iamnifer
#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <stack>
#include <deque>
#include <queue>
#include <iomanip>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define ull unsigned long long
#define uint unsigned int
#define elif else if
#define pb push_back
#define add insert
#define fastio cout.tie(nullptr); cin.tie(nullptr); ios_base::sync_with_stdio(false)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define str to_string

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;

template<typename A, typename B>
inline bool umin(A &a, B b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<typename A, typename B>
inline bool umax(A &a, B b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
T binpow(T b, T e, T m) {
    T r = 1;
    while(e > 0) {
        if(e & 1) r = r * b % m;
        b = b * b % m;
        e >>= 1;
    }
    return r;
}

inline void precision(int x) {
    cout << fixed << setprecision(x);
}

template<typename T>
inline T gcd(T a, T b) {
    return __gcd(a, b);
}

template<typename T>
inline T lcm(T a, T b) {
    return a / gcd(a, b) * b;
}

template<typename T>
inline int len(T x) {
    return int(x.size());
}

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

inline ll rand(ll l, ll r) {
    return uniform_int_distribution<ll>(l, r)(rng);
}

string str(string &s) {
    return "\"" + s + "\"";
}

template<typename A, typename B>
string str(pair<A, B> v) {
    return str(v.first) + " " + str(v.second);
}

template<typename T>
string str(set<T>& v) {
    string r, e;
    for(auto &i: v) r += e + str(i), e = " ";
    return r;
}

template<typename T>
string str(vector<T>& v) {
    string r, e;
    for(auto &i: v) r += e + str(i), e = " ";
    return r;
}

void debug() {
    cerr << "\n";
}

template<typename Head, typename...Tail>
void debug(Head H, Tail...T) {
    cerr << " " << str(H);
    debug(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug(__VA_ARGS__)
#else
#define debug(...) 0
#endif

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma,sse4")
// #pragma comment(linker,"/STACK:128777216")

// #pragma GCC optimize("O3")

const ld pi = 3.14159265358979323846264338327950288419716939937510;
const ld eps = 1e-8;
const int inf = 1e9 + 9;
const ll MOD = 1e9 + 7;  // 998244353
const int maxN = 2e5 + 9;

int main() {
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    fastio;
    char a, b, c;
    string s; cin >> s;
    
    a = s[0]; b = s[1]; c = s[2];
    if(a == b && b == c) {
        cout << "Won\n";
    }
    else cout << "Lost\n";

}
