#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

bool isprime(long long n) {
  if (n < 2) return false;
  if (n == 2) return true;
  if (n % 2 == 0) return false;
  
  for (long long i = 3; i * i <= n; i += 2)
    if (n % i == 0)
      return false;
  
  return true;
}

bool sq(int n) {
  for (int i = 2; i < 10; i++)
    if (i * i == n)
      return true;
  return false;
}

bool cube(int n) {
  for (int i = 2; i < 8; i++)
    if (i * i * i == n)
      return true;
  return false;
}

// sum of divisors of n
// e.g) sigma(28) = 1 + 2 + 4 + 7 + 14 + 28 = 56
long long sigma(long long n) {
  long long ret = 1;
  for (long long k = 2; k * k <= n; k++) {
    long long p = 1;
    while (n % k == 0) {
      p = p * k + 1;
      n /= k;
    }
    ret *= p;
  }
  if (n > 1)
    ret *= n + 1;
  return ret;
}

bool perfect(int n) {
  return sigma(n) - n == n;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n; cin >> n;
  if (isprime(n))
    cout << "Sosu!" << endl;
  else if (sq(n))
    cout << "Heihosu!" << endl;
  else if (cube(n))
    cout << "Ripposu!" << endl;
  else if (perfect(n))
    cout << "Kanzensu!" << endl;
  else
    cout << n << endl;
  
  return 0;
}