//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <complex>
#include <regex>
#include <locale>
#include <random>
#include <type_traits>

using namespace std;

#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}

using LL = long long;

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

vector<LL> divisors(LL n) {
    vector<LL> ret;
    for (LL i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ret.push_back(i);
            if (n / i != i) {
                ret.push_back(n / i);
            }
        }
    }
    return ret;
}

int main() {

    LL N;
    cin >> N;

    bool isPrime = true;
    for (LL i = 2; i < N; i++) if (N % i == 0) isPrime = false;
    if (isPrime && N >= 2) {
        cout << "Sosu!" << endl;
        return 0;
    }

    for (LL i = 1; i <= 100; i++) {
        if (i * i == N && i >= 2) {
            cout << "Heihosu!" << endl;
            return 0;
        }
    }

    for (LL i = 1; i <= 100; i++) {
        if (i * i == N && i >= 2) {
            cout << "Ripposu!" << endl;
            return 0;
        }
    }

    auto ret = divisors(N);
    if (accumulate(ret.begin(), ret.end(), 0LL) - N == N) {
        cout << "Kanzensu!" << endl;
        return 0;
    }


    if (isPrime) cout << "Sosu!" << endl;
    else cout << N << endl;

    return 0;
}