#include <bits/stdc++.h>
using namespace std;

#define FOR(i, m, n) for(int (i) = (m); (i) < (n); (i)++)
#define rep(i, n) FOR(i, 0, n)
#define repn(i, n) FOR(i, 1, n+1)
#define co(n) cout << (n) << endl
#define cosp(n) cout << (n) << ' '
#define setp(n) cout << fixed << setprecision(n);
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
typedef long long ll;
typedef pair<int, int> P;

const ll INF = 1e9+1;
const ll LINF = 1e18+1;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const double PI = acos(-1);
const double EPS = 1e-9;

vector<int> sosu = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61};
vector<int> heihosu = {4, 9, 16, 25, 36, 49};
vector<int> ripposu = {8, 27};

int main(void){
	ll n;
	cin >> n;

	if(n == 0){
		co(0);
		return 0;
	}else if(n == 1){
		co(1);
		return 0;
	}

	for(int i : sosu){
		if(n == i){
			co("Sosu!");
			return 0;
		}
	}

	for(int i: heihosu){
		if(n == i){
			co("Heihosu!");
			return 0;
		}
	}

	for(int i : ripposu){
		if(n == i){
			co("Ripposu!");
			return 0;
		}
	}

	int sum = 0;
	for(int i = 1; i*i <= n; i++){
		if(!(n%i)){
			if(n/i != i) sum += n/i;
			sum += i;
		}
	}

	if(n*2 == sum){
		co("Kanzensu!");
		return 0;
	}

	co(n);
	return 0;
}