#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcountll

#define INF 1e16
#define mod 1000000007

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

  ll n;
  cin>>n;
  if(n>=2){
    bool ok=true;
    repl(i,2,n){
      if(n%i==0){
        ok=false;
      }
    }
    if(ok){
      cout<<"Sosu!"<<endl;
      return 0;
    }
  }
  {
    bool ok=false;
    repl(i,2,n+1){
      if(i*i==n){
        ok=true;
      }
    }
    if(ok){
      cout<<"Heihosu!"<<endl;
      return 0;
    }
  }
  {
    bool ok=false;
    repl(i,2,n+1){
      if(i*i*i==n){
        ok=true;
      }
    }
    if(ok){
      cout<<"Ripposu!"<<endl;
      return 0;
    }
  }
  {
    if(n==6||n==28){
      cout<<"Kanzensu!"<<endl;
      return 0;
    }
  }

  cout<<n<<endl;

  return 0;
}