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

const ll mod = ll(1e9) + 7;
const int INF = 1<<29;

int main(){
    int n;
    cin >> n;
    if (n==0 || n==1) cout << n << endl;
    else{
        for (int i=2;i<=(n+1)/2;i++){
            if (n%i==0) break;
            if (i==int(pow(n,0.5))){
                cout << "Sosu!" << endl;
                return 0;
            }
        }
        int j = 2;
        while (j*j<=n){
            if (j*j==n){
                cout << "Heihosu!" << endl;
                return 0;
            }
            j++;
        }
        j = 2;
        while(j*j*j<=n){
            if (j*j*j==n){
                cout << "Ripposu!" << endl;
                return 0;
            }
            j++;
        }
        vector<int> kan;
        for (int i=1;i<n;i++){
            if (n%i==0) kan.push_back(i);
        }
        int res = 0;
        for (auto x:kan) res += x;
        if (res==n){
            cout << "Kanzensu!" << endl;
            return 0;
        }
        cout << n << endl;
    }
    return 0;
}