#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
}

ll d[2000100];

bool prime[1000010];
void furui() {
	int i = 2;
	prime[0]=true;
	prime[1]=true;
	while (i <= 1000000) {
		int j = 2;
		while (j*j <= i && !prime[i]) {
			if (i%j == 0) {
				prime[i] = true;
				break;
			}
			else j++;
		}
		int z = 2;
		while (!prime[i]) {
			if (i*z <= 1000000) {
				prime[i*z] = true;
				z++;
			}
			else break;
		}
		i++;
	}
}

int main(void){
	furui();
	int n;
	cin>>n;
	if(!prime[n]){
		cout<<"Sosu!"<<endl;
		return 0;
	}
	for(ll i=2;i*i<=n;i++){
		if(i*i==n){
			cout<<"Heihosu!"<<endl;
			return 0;
		}
	}
	for(ll i=2;i*i*i<=n;i++){
		if(i*i*i==n){
			cout<<"Ripposu!"<<endl;
			return 0;
		}
	}
	ll t = 1;
	for(ll i=2;i*i<=n;i++){
		if(n%i==0){
			ll k = n/i;
			t+=i+k;
		}
	}
	if(n!=1 && t==n)cout<<"Kanzensu!"<<endl;
	else cout<<n<<endl;
	return 0;
}