#include #include #define M 10000 void run(void){ int n; scanf("%d",&n); char *isPrime; isPrime=(char *)malloc(sizeof(char)*(M+1)); int i,j; isPrime[0]=isPrime[1]=0; for(i=2;i<=M;i++) isPrime[i]=1; for(i=2;i*i<=M;i++){ if(isPrime[i]){ for(j=i*i;j<=M;j+=i){ isPrime[j]=0; } } } char *win; win=(char *)calloc(M+1,sizeof(char)); win[0]=win[1]=1; for(i=2;i<=n;i++){ for(j=2;j<=i;j++){ if(isPrime[j] && !win[i-j]){ win[i]=1; break; } } } printf("%s\n",win[n]?"Win":"Lose"); free(isPrime); free(win); return; } int main(void){ run(); return 0; }