#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    set<int> r = {8,27}, h = {4,9,16,25,36,49}, p = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61};
    int n;
    cin>>n;
    if(n==6||n==28){
        cout<<"Kanzensu!"<<endl;
        return 0;
    }
    else if(r.count(n)){
        cout<<"Ripposu!"<<endl;
    }
    else if(h.count(n)){
        cout<<"Heihosu!"<<endl;
    }
    else if(p.count(n)){
        cout<<"Sosu!"<<endl;
    }
    else cout<<n<<endl;
    return 0;
}