#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;

vector<long long> divisor(long long n){
    vector<long long> ret;
    for(long long i = 1; i * i <= n; i++){
        if(n % i == 0){
            ret.push_back(i);
            if(i * i != n) ret.push_back(n / i);
        }
    }
    sort(begin(ret), end(ret));
    return (ret);
}

signed main(){
    int n;
    cin >> n;
    vector<ll> vec = divisor(n);
    if(vec.size() == 2){
        cout << "Sosu!" << endl;
    }else if(n == 4 || n == 9 || n == 16 || n == 25 || n == 36 || n == 49){
        cout << "Heihosu!" << endl;
    }else if(n == 8 || n == 27){
        cout << "Ripposu!" << endl;
    }else if(n == 28){
        cout << "Kanzensu!" << endl;
    }else{
        cout << n << endl;
    }
}