#include <bits/stdc++.h>

using namespace std;

using ll = long long;

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

vector<int> divisor(int n) {
    vector<int> res;
    for (int i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            res.emplace_back(i);
            if (i != n / i) res.emplace_back(n / i);
        }
    }
    return res;
}

map<int, int> prime_factor(int n) {
    map<int, int> res;
    for (int i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            ++res[i];
            n /= i;
        }
    }
    if (n != 1) res[n] = 1;
    return res;
}

vector<int> sieve(int n) {
    vector<int> res;
    vector<bool> is_prime(n + 1, true);
    is_prime[0] = false;
    is_prime[1] = false;
    for (int i = 2; i <= n; i++) {
        if (!is_prime[i]) continue;
        res.emplace_back(i);
        for (int j = 2 * i; j <= n; j += i) is_prime[j] = false;
    }
    return res;
}

bool isKanzen(ll n) {
    if (n == 0) return false;
    ll ans = 0;
    for (ll i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ans += i;
            if (i != n / i) ans += n / i;
        }
    }
    return ans == n * 2;
}

bool isSquare(int n) {
    for (int i = 2; i * i <= n; i++) {
        if (i * i == n) return true;
    }
    return false;
}

bool isCubic(int n) {
    for (int i = 2; i * i * i <= n; i++) {
        if (i * i * i == n) return true;
    }
    return false;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    if (is_prime(n)) cout << "Sosu!\n";
    else if (isSquare(n)) cout << "Heihosu!\n";
    else if (isCubic(n)) cout << "Ripposu!\n";
    else if (isKanzen(n)) cout << "Kanzensu!\n";
    else cout << n << endl;
    return 0;
}