#include<bits//stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <=  n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;
ll mod = 1e9+7;
bool isPrime(int x){
    int i;
    if(x < 2)return 0;
    else if(x == 2) return 1;
    if(x%2 == 0) return 0;
    for(i = 3; i*i <= x; i += 2) if(x%i == 0) return 0;
    return 1;
}
int main(){
   int n;cin >>n;
   if(isPrime(n)){
       cout << "Sosu!"<<endl;
       return 0;
   }int sum = 0;
   for(int i= 1;i*i<=n;i++){
       if(i*i==n){
           cout << "Heihosu!"<<endl;
           return 0;
       }if(i*i*i==n){
           cout << "Ripposu!"<<endl;
           return 0;
       }
   }for(int i=1;i*i<n;i++){
       if(n%i==0){
           sum += i;sum+=n/i;
       }
   }if(sum-n==n) cout << "Kanzensuu!"<<endl;
   else cout << n <<endl;
}