#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n;
    cin >> n;
    bool b0 = true;
    auto b1 = [](int32_t n) {
        if (n == 0 || n == 1)
            return false;
        for (auto i = 2; i * i <= n; ++i) {
            if (n % i == 0)
                return false;
        }
        return true;
    }(n);
    if (b1) {
        cout << "Sosu!" << endl;
        b0 = false;
    }
    auto b2 = [](int32_t n) {
        for (auto i = 0; i * i <= n; ++i) {
            if (i * i == n)
                return true;
        }
        return false;
    }(n);
    if (b2) {
        cout << "Heihosu!" << endl;
        b0 = false;
    }
    auto b3 = [](int32_t n) {
        for (auto i = 0; i * i * i <= n; ++i) {
            if (i * i * i == n)
                return true;
        }
        return false;
    }(n);
    if (b3) {
        cout << "Ripposu!" << endl;
        b0 = false;
    }
    auto b4 = [](int32_t n) {
        if (n == 0)
            return false;
        int32_t sum = 0;
        for (auto i = 1; i < n; ++i) {
            if (n % i == 0)
                sum += i;
        }
        return sum == n;
    }(n);
    if (b4) {
        cout << "Kanzensu!" << endl;
        b0 = false;
    }
    if (b0) {
        cout << n << endl;
    }
    return 0;
}