// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = int64_t;
using ull = uint64_t;
using PLL = pair<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
// #include "../debug/debug.cpp"
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}

bool is_prime(ll n) {
    if(n == 0) return false;
    if(n == 1) return false;
    if(n == 2) return true;
    for(ll i = 2; i < n; i++) if(n % i == 0) return false;
    return true;
}

bool find_num(const V<ll> &nums, ll n) {
    auto ite = find(ALL(nums), n);
    return ite != nums.end();
}


V<string> solve(ll N) {
    V<ll> perfect = { 6, 28, 496, };
    V<ll> pow2, pow3;
    for(ll i = 0; i < N; i++) {
        pow2.push_back(i * i);
        pow3.push_back(pow2.back() * i);
    }
    V<string> ret;
    if(find_num(perfect, N)) ret.push_back("Kanzensu!");
    if(find_num(pow2, N)) ret.push_back("Heihosu!");
    if(find_num(pow3, N)) ret.push_back("Ripposu!");
    if(is_prime(N)) ret.push_back("Sosu!");
    return ret;
}

int main() {
    ll N;
    cin >> N;
    auto res = solve(N);
    if(res.size() == 1) cout << res[0];
    else cout << N;
    cout << endl;
    return 0;
}