#include "bits/stdc++.h"              // only gcc
using namespace std;                  // std::cout, std::endl

#pragma region TEMPLATE
constexpr auto INF = 1000000000000;   //10^12;;
constexpr auto MOD = 1000000007;      //10^9+7;;
constexpr auto EPS = 1e-9;
constexpr auto PI  = 3.141592653589793238462643383279;
#define endl '\n';                    // std::endl => '\n'
#define nl  cout << endl;
#define ALL(v) v.begin(), v.end() 
#define RALL(x) (x).rbegin(), (x).rend()
#define SORT(v) sort(ALL(v)) 
#define RSORT(v) sort(RALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SZ(x) ((int)(x).size())
#define FOR(i,j,k)  for (int i=j; i<k; i++)
#define RFOR(i,j,k) for (int i=j; i>=k; i--)
#define REP(i, j)   FOR(i, 0, j)
#define RREP(i, j) RFOR(i, j, 0)
#define FOREACH(it,l) for (auto it = l.begin(); it != l.end(); it++)
#define YES(p) cout << (p ? "YES":"NO") << endl;
#define Yes(p) cout << (p ? "Yes":"No") << endl;
template<class T = int>T in(){T x; cin >> x; return x; }   // read
template<class T> void out(T value){ cout << value << endl; }// write
template<class T> bool chmax(T& a,const T& b){ if (a < b){ a = b; return 1; } return 0; } // change max
template<class T> bool chmin(T& a,const T& b){ if (b < a){ a = b; return 1; } return 0; } // change min

using  VI = vector<int>;
using  ll = long long;
using VLL = vector<ll>;
#pragma endregion

bool isPrime(ll n) {
    if (n <= 1)     return false;
    else if (n == 2) return true;

    if (n % 2 == 0) return false;
    for (ll i = 3; i * i <= n; i++) {
        if (n % i == 0) return false;
    }
    return true;
}

bool isSquare(ll num) {
    ll rt = ll(sqrt(double(num)));
    return rt * rt == num;
}
bool isCubic(ll num) {
    ll rt = ll(cbrt(double(num)));
    return rt * rt * rt == num;
}
vector<int64_t> divisor(int64_t n) {
    vector<int64_t> ret;
    for (int64_t i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ret.push_back(i);
            if (i * i != n) ret.push_back(n / i);
        }
    }
    sort(begin(ret), end(ret));
    return (ret);
}
bool isPerfect(ll num) {    
    ll sum{ 0 };
    auto divs = divisor(num);
    for (auto v : divs) {
        if (v != num) {
            sum += v;
        }
    }
    return sum == num;
}

signed main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false); 
    cout << fixed << setprecision(10);
    
    ll n = in<ll>();
    if (n == 0) {
        out(0);
        return 0;
    }

    if (isPrime(n)) {
        out("Sosu!");
    }
    else if (n >= 2 and isSquare(n)) {
        out("Heihosu!");
    }
    else if(n >= 2 and isCubic(n)) {
        out("Ripposu!");
    }
    else if (isPerfect(n)) {
        out("Kanzensu!");
    }
    else {
        out(n);
    }

    return 0;
}