#include <iostream>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <list>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
int i, j, k;
int m, n, p;
double a[100];
int main() {
	a[0] = a[1] = 1;
	for (i = 2; i < 100; i++)
		a[i] = a[i - 1] + a[i - 2];//斐波那契博弈
	while (scanf("%d", &n) != EOF) {
		m = 0;
		for (i = 0; i < 60; i++)
			if (n == a[i])
				m++;
		if (m > 0)
			printf("mwy win\n");
		else
			printf("sjy win\n");
	}
	return 0;

}