#include <iostream>
#include <vector>

using namespace std;

int primeHunter(int x) {

    if (x<=1) return -1;
    if (x==2) return x;
    if (x%2==0) return -1;

    for (int i=3;i*i<=x;i+=2) {
        if (x%i==0) return -1;
    }
    return x;
}

int main() {
    int n;
    cin >> n;

    vector<int> p;
    vector<bool> iswin(n+1, true);

    for (int i=2;i<=n;i++) {
        int prm = primeHunter(i);
        if (prm==-1) continue;
        p.push_back(prm);
    }

    for (int i=2;i<=n;i++) {
        bool b = false;
        for (int pr : p) {
            if (i<pr) continue;
            if (iswin[i-pr]==false) b = true;
        }
        iswin[i] = b;
    }

    cout << (iswin[n] ? "win" : "lose") << endl;

    return 0;

}