#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N; cin >> N;
  vector<int> ps = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61};
  vector<int> hei = {4,9,16,25,36,49};
  vector<int> rip = {8,27};
  vector<int> kan = {6,28};
  if(binary_search(all(ps),N)) cout << "Sosu!" << endl;
  else if(binary_search(all(hei),N)) cout << "Heihosu!" << endl;
  else if(binary_search(all(rip),N)) cout << "Ripposu!" << endl;
  else if(binary_search(all(kan),N)) cout << "Kanzensu!" << endl;
  else cout << to_string(N) << endl;
  return 0;
}