#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define f(i,n)			for(int i=0;i<n;i++)
#define fs(i,s,n)		for(int i=s;i<n;i++)
#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define MOD             998244353;
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
#define PI              3.1415926535897932384626

mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());
 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;



int inv(int a) {
    int r = 1, t = a, k = MOD - 2;
    while (k) {
        if (k & 1) r = (long long) r * t % MOD;
        t = (long long) t * t % MOD;
        k >>= 1;
    }
    return r;
}

int mpow(int base, int exp) {
  base %= mod;
  int result = 1;
  while (exp > 0) {
    if (exp & 1) result = (result * base) % mod;
    base = (base * base) % mod;
    exp >>= 1;
  }
  return result;
}
 
 
void sm25official()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

int32_t main(){
    sm25official();
    string s;
    cin>>s;

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

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const ll INFL = (1ll << 60);
//cout << setprecision(20) << 

int main() {
    ll n; cin >> n;
    ll pn = pow(2, n);
    vector<P> a(pn);
    for (int i = 0; i < pn; i++) {
        ll _a; cin >> _a;
        a[i] = P(i + 1, _a);
    }

    vector<P> next;
    vector<P> prev = a;
    while (prev.size() != 2) {
        for (int i = 0; i < prev.size(); i+=2) {
            P target = prev[i];
            if (prev[i].second < prev[i + 1].second) target = prev[i + 1];
            next.push_back(target);
            getchar();
        }
        prev = next;
        next = vector<P>();
    }
    if (prev[0].second < prev[1].second) {
        cout << prev[0].first << endl;
    }
    else {
        cout << prev[1].first << endl;
    }
}