#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<cmath>
#include<string>
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
const LL infll = 0x3f3f3f3f3f3f3f3f;
const LL mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int maxn = 1e5 + 5;
const int maxm = 1.5e7 + 5;
using namespace std;
int f[105];
int main()
{
	int n;
	f[1] = 2, f[2] = 3;
	for (int i = 3;f[i - 1] <= maxn;i++)
	{
		f[i] = f[i - 1] + f[i - 2];
	}
	while (~scanf("%d", &n))
	{
		int flag = 0;
		for (int i = 1;f[i] <= n;i++)
		{
			if (f[i] == n)
			{
				printf("mwy win\n");
				flag = 1;
				break;
			}
		}
		if (!flag)printf("sjy win\n");
	}
	return 0;
}