#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <set>
#include <string>
#include <map>
#include <queue>
#include <stack>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <deque>
#define clr(a,b) memset(a,b,sizeof(a))
#define ll long long

using namespace std;

const int maxn=1e5+10;
int n;
int a[maxn];
int len;

void get()
{
	a[1]=2,a[2]=3;
	len=3;
    while(1)
    {
    	a[len]=a[len-1]+a[len-2];
    	len++;
    	if(a[len]>1e5)
    	{
    		len--;
    		break;
		}
	}
}

int main()
{
	get();
    while(~scanf("%d",&n))
    {
    	int f=0;
    	for(int i=1;i<=len;i++)
    	{
    		if(n==a[i])
    		{
    			f=1;
    			break;
			}
			else if(a[i]>n)break;
		}
    	if(f)printf("mwy win\n");
		else printf("sjy win\n"); 
	}
}