#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using mint = atcoder::modint998244353;
using maxt = atcoder::modint1000000007;
vector<ll> Era(int N) {
  vector<ll> ans(0, 0);
  vector<bool> isprime(N + 1, true);
  isprime.at(1) = false;
  for(int i = 1; i <= N; i++) {
    if(isprime.at(i)) {
      ans.push_back(i);
      for(int j = 2 * i; j <= N; j += i) {
        isprime.at(j) = false;
      }
    }
  }
  return ans;
}
ll POW(ll a, int N) {
  if(N == 1) {
    return a;
  }
  ll ans = POW(a, N / 2) * POW(a, N / 2);
  if(N % 2 == 1) {
    ans *= a;
  }
  return ans;
}
//ライブラリここまで

vector<ll> prime;
int main() {
  prime = Era(63);
  ll N;
  cin >> N;
  for(ll o : prime) {
    if(N == o) {
      cout << "Sosu!" << endl;
      return 0;
    }
  }
  for(int i = 2; i < 8; i++) {
    if(pow(i, 2) == N) {
      cout << "Heihosu!" << endl;
      return 0;
    }
    if(pow(i, 3) == N) {
      cout << "Ripposu!" << endl;
      return 0;
    }
  }
  if(N == 6 || N == 28) {
    cout << "Kanzensu!" << endl;
    return 0;
  }
  cout << N << endl;
}