#include <iostream>
#include <cmath>
using namespace std;

int isprime(int x) {
	int a = 1, i;
	double root_x;
	if (x == 2) a = 1;
	else if (x < 2 or x % 2 == 0) a = 0;
	i = 3;
	root_x = pow(x, 0.5);
	while (i <= root_x) {
		if (x % i == 0) a = 0;
		i = i + 2;
	}
	return a;
}

int main(void) {
	int n;
	cin >> n;
	double EI = 0.00000001;
	double a = n;
	int fact = 0;
	for (int i = 1; i <= sqrt(n); ++i) {
		if (n % i == 0) {
			fact += i;
			if (i != n / i)
				fact += n / i;
		}
	}
	fact -= n;

	if (isprime(n)) {
		cout << "Sosu!" << endl;
	}
	else if (sqrt(a) == floor(sqrt(a)) && n >= 2){
		cout << "Heihosu!" << endl;
	}
	else if (abs(cbrt(a) - floor(cbrt(a))) < EI && n >= 2) {
		cout << "Ripposu!" << endl;
	}
	else if (fact == n && n != 0) {
		cout << "Kanzensu!" << endl;
	}
	else {
		cout << n << endl;
	}
	return 0;
}