#include<bits/stdc++.h>
using namespace std;
template<class T1,class T2> bool cmax(T1& a,const T2& b){return a<b?a=b,1:0;}
template<class T1,class T2> bool cmin(T1& a,const T2& b){return b<a?a=b,1:0;}
#define fir(i,x,y,...) for(int i(x),##__VA_ARGS__;i<=(y);i++)
#define firr(i,x,y,...) for(int i(x),##__VA_ARGS__;i>=(y);i--)
#define fird(i,x,y,d,...) for(int i(x),##__VA_ARGS__;i<=(y);i+=(d))
#define firrd(i,x,y,d,...) for(int i(x),##__VA_ARGS__;i>=(y);i-=(d))
#define Yes cout<<"Yes\n"
#define No cout<<"No\n"
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define endl "\n"
#define ll long long
#define ull unsigned long long
int T;
bool _mul=0;
int gcd(int x,int y){if(!y) return x;return gcd(y,x%y);}
int power(int b,int p,int mod){int res=1;while(p){if(p&1) res=1ll*res*b%mod;b=1ll*b*b%mod;p>>=1;}return res;}
const int N=1e5+5;
int n;
int a[N];
void solve()
{
    cin>>n;
    fir(i,1,n) cin>>a[i];
    sort(a+1,a+n+1);
    if(n%3==0&&a[n-1]<=2&&a[n]!=1&&a[n-2]<=1) cout<<"Win"<<endl;
    else if(n%3==1&&a[n-1]<=2&&a[n-2]<=1) cout<<"Win"<<endl;
    else if(n%3==2&&a[n-1]==1) cout<<"Win"<<endl;
    else cout<<"Lose"<<endl;
    return;
}
int main()
{
    //freopen("1.in","r",stdin);
    //freopen("1.out","w",stdout);
    cin.tie(nullptr)->sync_with_stdio(false);
    if(_mul) cin>>T;
    else T=1;
    while(T--) solve();
    return 0;
}