#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
typedef pair<int, bool> sP;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef vector<ll> vec;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-5;
const ld pi = acos(-1.0);

void solve() {
	int n; cin >> n;
	bool isp = true;
	if (n == 0 || n == 1)isp = false;
	for (int i = 2; i < n; i++) {
		if (n%i == 0) {
			isp = false;
		}
	}
	if (isp) {
		cout << "Sosu!" << endl; return;
	}
	bool is2 = false, is3 = false;
	for (int i = 0; i <= n; i++) {
		if (i*i == n)is2 = true;
		if (i*i*i == n)is3 = true;
	}
	if (is2) {
		cout << "Heihosu!" << endl; return;
	}
	if (is3) {
		cout << "Ripposu!" << endl; return;
	}
	if (n == 6 || n == 28) {
		cout << "Kanzensu!" << endl; return;
	}
	cout << n << endl;
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	solve();
//	stop
	return 0;
}