#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define esper(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<int(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<x<<'\n',static_cast<void>(0)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<fixed<<setprecision(16);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
constexpr ll inf=1ll<<59;
ll safe_pow(ll a,ll b){
  ll ret=1;
  while(b){
    if(b&1){
      if((double)ret*a>1e18)return inf;
      ret*=a;
    }
    if((double)a*a>1e18)a=inf;
    else a=a*a;
  }
  return min(ret,inf);
}
void SOLVE(){
  ll n,k;
  cin>>n>>k;
  k--;
  vector<ll>dp(100000,0);
  dp[1]=7;
  reps(i,2,100000){
    dp[i]=min(inf,dp[i-1]*4+3);
  }
  if(n>=100000){
    if(n>k)fin('y');
    k-=(n-99999);
    n=99999;
  }
  while(true){
    if(n==1)fin("yuusaan"[k]);
    if(k==0)fin('y');
    if(k<dp[n-1]+1){
      k--;
      n--;
    }
    else if(k<dp[n-1]*2+1){
      k-=dp[n-1]+1;
      n--;
    }
    else if(k==dp[n-1]*2+1)fin('s');
    else if(k<dp[n-1]*3+2){
      k-=dp[n-1]*2+2;
      n--;
    }
    else if(k<dp[n-1]*4+2){
      k-=dp[n-1]*3+2;
      n--;
    }
    else fin('n');
  }
}