#include #define rep(i,n) for(int i=0;i ; const int INF = 1e9; const int MOD = 1000000007; bool is_prime(int x){ bool res = true; for(int i=2;i*i<=x;i++){ if(x%i == 0){ res = false; break; } } return res; } bool is_square(int x){ bool res = false; for(int i=2;i*i<=x;i++){ if(i*i == x){ res = true; break; } } return res; } bool is_cube(int x){ bool res = false; for(int i=2;i*i<=x;i++){ if(i*i*i == x){ res = true; break; } } return res; } bool is_perfect(int x){ int res = 1; for(int i=2;i*i<=x;i++){ if(x%i == 0){ res += i; if(i * i == x); else res += x/i; } } return res == x; } int main(){ int n; cin >> n; if(n==0) cout << 0 << endl; else if(n==1) cout << 1 << endl; else if(is_prime(n)) cout << "Sosu!" << endl; else if(is_square(n)) cout << "Heihosu!" << endl; else if(is_cube(n)) cout << "Ripposu!" << endl; else if(is_perfect(n)) cout << "Kanzensu!" << endl; else cout << n << endl; return 0; }