#include <bits/stdc++.h>
using namespace std;
template <typename T> using min_priority_queue = priority_queue<T,vector<T>,greater<T>>;

template<typename T>
void printv(vector<T> &v){
    bool b = false;
    for(auto i : v){
        if(b) cout << " ";
        else b = true;
        cout << i;
    }
    cout << endl;
}

template <typename T>
bool chmin(T &a, const T& b) {
    if (a > b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T &a, const T& b) {
    if (a < b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

bool debug;
bool randomInput;
void input(){
    if(debug && randomInput){
        
    }
    else{
        
    }
    return;
}

void calc(){
    int N; cin >> N;
    vector<int> P = {2};
    for(int i = 3; i <= N; i++){
        bool b = true;
        for(int p : P){
            if(i%p == 0){
                b = false;
                break;
            }
            if(p*p > i) break;
        }
        if(b) P.push_back(i);
    }

    vector<int> G(N+1,0);
    G[0] = -1;
    G[1] = -1;
    for(int i = 2; i <= N; i++){
        set<int> S;
        for(int p : P){
            if(i-p < 2) break;
            S.insert(G[i-p]);
        }
        for(int j = 0; j <= N; j++){
            if(!S.count(j)){
                G[i] = j;
                break;
            }
        }
    }

    if(G[N]){
        cout << "Win" << endl;
    }
    else cout << "Lose" << endl;
    return;
}

int64_t ansSimple;
void calcSimple(){
    return;
}

void calc1(){
    int t; cin >> t;
    for(int i = 0; i < t; i++){
        input();
        calc();
        calcSimple();
    }
}

int main(){
    debug = 0;
    randomInput = 0;
    srand(time(NULL));
    cout << fixed << setprecision(12);
    if(debug){
        calc1();
    }
    else{
        input();
        calc();
    }
    return 0;
}
//