#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const int maxn=1e7+100;
int a[maxn],b[maxn];
void fobo(int n){
	a[0]=1;
	a[1]=2;
	b[1]=1;
	b[2]=1;
	for(int i=2;i<=n;i++){
		a[i]=a[i-1]+a[i-2];
		b[a[i]]=1;
	}
}
int main(){
	fobo(25);
	int n;
	while(~scanf("%d",&n)){
		if(b[n]) printf("mwy win\n");
		else printf("sjy win\n");
	}
}