#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>

#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for(ll i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define clr(ar, val) memset(ar, val, sizeof(ar))
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair <int,int> P;
typedef long double ld;

int main(void)
{
	ll n, ans = 0;
	cin >> n;
	for (ll i = 1; i * i <= n; i++) {
		if (n % i == 0) {
			ans += i + (i * i == n ? 0 : n / i);
		}
	}
	if (ans == n + 1) {
		cout << "Sosu!" << endl;
	} else if (ans == 2 * n) {
		cout << "Kanzensu!" << endl;
	} else if (n != 1) {
		bool flg = false;
		for (ll i = 2; i * i <= n; i++) {
			if (i * i * i == n) {
				cout << "Ripposu!" << endl;
				flg = true;
			}
			if (i * i == n) {
				cout << "Heihosu!" << endl;
				flg = true;
			}
		}
		if (!flg) cout << n << endl;
	}
	return 0;
}