#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
#define fast() cin.tie(0), ios::sync_with_stdio(false)

template <typename T>
bool is_prime(T N)
{
    if (N < 2)
        return false;
    for (T i = 2; i * i <= N; ++i)
    {
        if (N % i == 0)
            return false;
    }
    return true;
}

bool is_seq(int N)
{
    for (int i = 0; i * i <= N; i++)
    {
        if (i * i == N)
            return true;
    }
    return false;
}

bool is_cub(int N)
{

    for (int i = 0; i * i * i <= N; i++)
    {
        if (i * i * i == N)
            return true;
    }
    return false;
}

int N;

int main()
{
    cin >> N;
    bool flag = is_prime(N) || is_seq(N) || is_cub(N) || N == 6 || N == 28;
    if (is_prime(N))
        cout << "Sosu!\n";
    if (is_seq(N))
        cout << "Heihosu!\n";
    if (is_cub(N))
        cout << "Ripposu!\n";
    if (N == 6 || N == 28)
        cout << "Kanzensu!\n";
    if (!flag)
        cout << N << endl;
}