#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll INF = 1ll<<30;
const ll longINF = 1ll<<60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
const bool debug = 0;
//---------------------------------//

vector<int> sieve(int n) {
	vector<int> res;
	vector<bool> is_prime(n + 1, true);
	
	is_prime[0] = is_prime[1] = false;
	
	for (ll i = 2; i * i <= n; i++) if (is_prime[i]) {
		res.push_back(i);
		for (ll j = 1; i * j <= n; j++) is_prime[i * j] = false;
	}
	
	REP(i, n + 1) if (is_prime[i]) res.push_back(i);
	sort(res.begin(), res.end());
	return res;
}

vector<ll> findDivisor(ll n) {
	vector<ll> divisor;
	for (ll i = 1; i * i <= n; i++) {
		if (n % i == 0) {
			divisor.push_back(i);
			if (i * i != n) divisor.push_back(n / i);
		}
	}
	return divisor;
}

int ans[64];
string str[5] = {"", "Sosu!", "Heihosu!", "Ripposu!", "Kanzensu!"};

int main() {
	int N;
	cin >> N;
	
	vector<int> prime = sieve(64);
	for (int cur : prime) ans[cur] = 1;
	
	ans[1] = 4;
	for (int i = 2; i < 64; i++) {
		if (i * i < 64) ans[i * i] = 2;
		if (i * i * i < 64) ans[i * i * i] = 3;
		
		vector<ll> divisor = findDivisor(i);
		int sum = accumulate(ALL(divisor), 0) - N;
		if (sum == i) ans[i] = 4;
	}
	
	if (ans[N] == 0) cout << N << endl;
	else cout << str[ans[N]] << endl;
	
	return 0;
}