#include "bits/stdc++.h" using namespace std; using ll = long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vvi = vector; using vvl = vector; const ll INF = 1LL << 60; const ll MOD = 1000000007; template bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0; } template bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0; } template void print(const C &c, std::ostream &os = std::cout) { std::copy(std::begin(c), std::end(c), std::ostream_iterator(os, " ")); os << std::endl; } // Eratosthenes's sieve // create list of prime numbers in O(N) // check if the given number is prime in O(1) struct Sieve { vector isPrime; Sieve(size_t max) : isPrime(max + 1, true) { isPrime[0] = false; isPrime[1] = false; for (size_t i = 2; i * i <= max; ++i) // 0からsqrt(max)まで調べる if (isPrime[i]) // iが素数ならば for (size_t j = 2; i * j <= max; ++j) // (max以下の)iの倍数は isPrime[i * j] = false; // 素数ではない } bool operator()(size_t n) { return isPrime[n]; } }; // list up all factors template set factors(T a) { set facs; for (T i = 1; i * i <= a; ++i) { if (a % i == 0) { facs.insert(i); facs.insert(a / i); } } return facs; } int main() { int n; cin >> n; Sieve isprime(64); set heiho; set rippo; set kanzen; for (int i = 2; i < 8; ++i) { heiho.insert(i*i); } for (int i = 2; i < 4; ++i) { rippo.insert(i*i*i); } kanzen.insert(6); kanzen.insert(28); if (isprime(n)) { cout << "Sosu!" << "\n"; } else if (heiho.count(n) == 1) { cout << "Heihosu!" << "\n"; } else if (rippo.count(n) == 1) { cout << "Ripposu!" << "\n"; } else if (kanzen.count(n) == 1) { cout << "Kanzensu!" << "\n"; } else { cout << n << "\n"; } return 0; }