#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

ll len(ll lev){
    if(lev<=30){
        ll res=2*(1LL<<(lev*2))-1;
        return res;
    }else{
        return (15LL<<58);
    }
}

string AA="yuusaan";

void solve(ll N,ll K){
    if(K<N){
        cout<<"y";
        return;
    }
    
    if(N==1){
        cout<<AA[K];
        return;
    }
    
    ll z=len(N-1);
    
    if(K<1+z){
        if(N>=100){
            ll hiku=(N-100);
            solve(99,K-hiku-1);
            return;
        }
        solve(N-1,K-1);
        return;
    }
    if(K<1+z+z){
        solve(N-1,K-1-z);
        return;
    }
    if(K==1+z+z){
        cout<<"s";
        return;
    }
    if(K<1+z+z+1+z){
        solve(N-1,K-1-z-z-1);
        return;
    }
    if(K<1+z+z+1+z+z){
        solve(N-1,K-1-z-z-1-z);
        return;
    }
    cout<<"n";
    return;
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N,K;cin>>N>>K;
    K--;
    solve(N,K);
    
    
    cout<<"\n";
}