#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(n);++i)

main(){

  ll n;
  cin>>n;

  auto prime_enumeration = [](ll n){
    vector<ll> primes;
    for(ll x=2;x<=n;++x){
      primes.emplace_back(x);
      for(ll p=2;p*p<=x;++p){
        if(x%p==0){
          primes.pop_back();
          break;
        }
      }
    }
    return primes;
  };
  auto square_enumeration = [](ll n){
    vector<ll> squares;
    for(ll p=2;p*p<=n;++p){
      squares.emplace_back(p*p);
    }
    return squares;
  };
  auto cubic_enumeration = [](ll n){
    vector<ll> cubics;
    for(ll p=2;p*p*p<=n;++p){
      cubics.emplace_back(p*p*p);
    }
    return cubics;
  };
  auto divior_enumeration = [](ll n){
    vector<ll> divisors = {1};
    for(ll p=2;p*p<=n;++p){
      if(n%p==0){
        divisors.emplace_back(p);
        if(p*p!=n)divisors.emplace_back(n/p);
      }
    }
    sort(divisors.begin(),divisors.end());
    return divisors;
  };
  auto vector_sum = [](vector<ll> const& v){
    ll sum = 0;
    for(auto const& value:v)sum+=value;
    return sum;
  };
  auto full_enumeration = [&](ll n){
    vector<ll> full_number;
    for(ll p=2;p<=n;++p){
      auto div = divior_enumeration(p);
      ll divsum = vector_sum(div);
      if(p==divsum)full_number.emplace_back(p);
    }
    return full_number;
  };

  vector<ll> primes = prime_enumeration(n);
  vector<ll> squares = square_enumeration(n);
  vector<ll> cubics = cubic_enumeration(n);
  vector<ll> fulls = full_enumeration(n);

  auto _find = [](vector<ll>const& v,ll key){
    for(auto const& value:v){
      if(value==key)return true;
    }
    return false;
  };

  if(_find(primes,n)){
    puts("Sosu!");
  }
  else if(_find(squares,n)){
    puts("Heihosu!");
  }
  else if(_find(cubics,n)){
    puts("Ripposu!");
  }
  else if(_find(fulls,n)){
    puts("Kanzensu!");
  }
  else{
    cout<<n<<endl;
  }

}