#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { std::cout << #a << " = " << a << "\n"; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }
template<class T, class V> istream& operator>> (istream& ist, pair<T, V>& p) { return ist >> p.first >> p.second; }
template<class T> ostream& operator<< (ostream& ost, pair<T, T>& p) { return ost << p.first << ", " << p.second; }
template<class T> istream& operator>> (istream& ist, vector<T>& vs) { for(auto& e: vs) ist >> e; return ist; }

typedef long long ll;
int const inf = 1<<29;

auto prime_factor = [](ll x){map<ll, int> xfact;for(int i=2; (ll)i*i<=x; i++) {while(x % i == 0) {xfact[i]++;x /= i;}}if(x > 1) xfact[x]++;return xfact;};

int main() {
  int N; cin >> N;
  if (N <= 1) {
    cout << N << endl;
    return 0;
  }
  ll sum = 0;
  bool is_prime = 1;
  bool hei = 0;
  bool rip = 0;
  REP(i, 1, N) {
    if (N % i == 0) {
      sum += i;
    }
    if (i >= 2) {
      is_prime = is_prime && (N % i);
      hei = hei || (i * i == N);
      rip = rip || (i * i * i == N);
    }
  }
  if (sum == N) {
    cout << "Kanzensu!\n";
  }
  else if (is_prime) {
    cout << "Sosu!\n";
  }
  else if (hei) {
    cout << "Heihosu!\n";
  }
  else if (rip) {
    cout << "Ripposu!\n";
  }
  else {
    cout << N << "\n";
  }
}