#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef long long int ll;

#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define endl "\n"
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//-------------------------------------

vector<ll> divisor(ll n)
{
    vector<ll> ret;
    for (ll 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 isPrime(ll n)
{
    if (n == 0 || n == 1)
    {
        return false;
    }
    for (ll i = 2; i * i <= n; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
    }
    return true;
}
bool isR(ll n)
{
    ll r[] = {8, 27};
    for (auto c : r)
    {
        if (n == c)
        {
            return true;
        }
    }
    return false;
}

bool isH(ll n)
{
    ll h[] = {4, 9, 16, 25, 36, 49};
    for (auto c : h)
    {
        if (n == c)
        {
            return true;
        }
    }
    return false;
}

bool isPerf(ll n)
{
    auto y = divisor(n);
    ll tmp = 0;
    for (auto c : y)
    {
        if (c != n)
        {
            tmp += c;
        }
    }
    return n == tmp;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    if (isPrime(n))
    {
        cout << "Sosu!" << endl;
    }
    else if (isH(n))
    {
        cout << "Heihosu!" << endl;
    }
    else if (isR(n))
    {
        cout << "Ripposu!" << endl;
    }
    else if (isPerf(n))
    {
        cout << "Kanzensu!" << endl;
    }
    else
    {
        cout << n << endl;
    }
}