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: 2517ms
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];

int Fngame(int x)
{
	if(x==1)    return 1;
	f[0]=f[1]=1;
	for(int i=1;f[i-1]<x;i++)
	{
		f[i]=f[i-1]+f[i-2];
		if(f[i]==x) return 1;
	}
	return 0;
}

int main()
{
//	Fngame(1e5);
	int n;
	while(~scanf("%d",&n))
	{
		if(Fngame(n)!=1) cout<<"sjy win"<<endl;
		else cout<<"mwy win"<<endl;
	}
}