如果先取的在2-n中取必输,则先取1,
否则则在2-n中取,同时会把1取走,必赢
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=101000;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a, b) memset(a, b, sizeof(a))
int main(){
int n;
while(scanf("%d",&n)!=EOF){
if(n==0)
printf("fail\n");
else
printf("win\n");
}
return 0;
}