#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
#define lowbit(x) (x&(-x))
using namespace std;
typedef long long ll;

const int maxn = 1e6 + 10;

int f[40];
int main()
{
   f[0] = 1;
   f[1] = 2;
   for(int i = 2;i<40;i++)
   {
       f[i] = f[i - 1] + f[i - 2];
       if(f[i] > 100000)
           break;
   }
   int n;
   while(~scanf("%d",&n))
   {
       int flag = 0;
       for(int i = 1; i < 40; i++)
           if(f[i] == n)
           flag = 1;
       if(flag)
           puts("mwy win");
       else
           puts("sjy win");
   }
}