Start: Jul, 03, 2019 08:38:00
2019年度暑期短学期第七天 助教场
End: Jul, 04, 2019 23:00:00
Time elapsed:
Time remaining:

Problem_ID: E
Result: Accepted
Time: 38ms
Memory: 2148kB
Author: 2018212212161
In contest: 1292

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e5 + 5;
const int inf=0x3f3f3f3f;

int  f[maxn];

void f1()
{
	f[1]=1;
	f[2]=1;
	f[3]=1;
	int p=2,pp=3;
	int tmp=p+pp;
	while(tmp<=1e5)
	{
		f[tmp]=1;
		p=pp,pp=tmp;
		tmp=p+pp;
	}
}

int main()
{
	f1();
	int n;
	while(~scanf("%d",&n))
	{
		if(f[n]==0) printf("sjy win\n");//<<"sjy win"<<endl;
		else printf("mwy win\n");//cout<<"mwy win"<<endl;
	}
}