#include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)

bool isPrime(int n) {
    if(n < 2) return false;
    rep(i, 2, n) if(n % i == 0) return false;
    return true;
}

bool isHe(int n) {
    if(n < 2) return false;
    rep(i, 1, n + 1) if(i * i == n) return true;
    return false;
}

bool isRi(int n) {
    if(n < 2) return false;
    rep(i, 1, n + 1) if(i * i * i == n) return true;
    return false;
}

bool isKan(int n) {
    int b = n;
    using P = pair<int, int>;
    vector<P> A;
    for(int i = 2; i * i <= n; ++i) {
        int cnt = 0;
        while(n % i == 0) {
            n /= i;
            cnt++;
        }
        if(cnt) A.push_back(make_pair(i, cnt));
    }
    if(n != 1) A.push_back(make_pair(n, 1));
    int ans = 1;
    for(auto p : A) {
        int a = (pow(p.first, p.second + 1) - 1)  / (p.first - 1);
        ans *= a;
    }
    return b == ans - b;
}

int main() {
    int N; cin >> N;
    if(isPrime(N)) cout << "Sosu!" << '\n';
    else if(isHe(N)) cout << "Heihosu!" << '\n';
    else if(isRi(N)) cout << "Ripposu!" << '\n';
    else if(isKan(N)) cout << "Kanzensu!" << '\n';
    else cout << N << '\n';
    return 0;
}