#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<iostream>
#define ll long long 
using namespace std;
const int maxn = 1e6 + 10;
const int inf = 0x3f3f3f3f;
int  n, m, k, N, t;
int a[maxn];
int main()
{
	memset(a, 0, sizeof a);
	ll x = 1, y = 1, c;
	a[1] = 1;
	c = x + y;
	while (c <= maxn - 10) 
	{
		a[c] = 1;
		x = y;
		y = c;
		c = x + y;
	}
	while (scanf("%d", &n) != EOF) 
	{
		if (a[n] == 1)
			printf("mwy win\n");
		else
			printf("sjy win\n");

	}

}