#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector1d(type,name,...) vector<type>name(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}

//素数か否かを判定する
template <typename T>
bool isPrime(T n){
    if(n<=1)return false;
    if(n==2||n==3)return true;
    if(n%2==0||n%3==0)return false;
    for(T q=5;q*q<=n;q+=4){
        if(n%q==0)return false;
        q+=2;
        if(n%q==0)return false;
    }
    return true;
}

int main(){
    vector<bool> kan(65,false),sosu(65,false),ripo(65,false),hei(65,false);
    INT(n);
    for(int i=0;i*i<=64;i++){
        hei[i*i]=true;
    }
    for(int i=0;i*i*i<=64;i++){
        ripo[i*i*i]=true;
    }
    for(int i=0;i<65;i++){
        if(isPrime(i))sosu[i]=true;
        int d=0;
        for(int j=1;j*j<=i;j++){
            if(i%j==0){
                if(j!=n)d+=j;
                if(i/j!=n&&i/j!=j)d+=i/j;
            }
        }
        //debug("enter");
        if(d==i)kan[i]=true;
    }
    if(kan[n]&&!sosu[n]&&!ripo[n]&&!hei[n]){
        out("Kanzensu!");
    }else if(!kan[n]&&sosu[n]&&!ripo[n]&&!hei[n]){
        out("Sosu!");
    }else if(!kan[n]&&!sosu[n]&&ripo[n]&&!hei[n]){
        out("Ripposu!");
    }else if(!kan[n]&&!sosu[n]&&!ripo[n]&&hei[n]){
        out("Heihosu!");
    }else{
        out(n);
    }
}