#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; typedef long double ld; const int inf=1e9+7; const ll longinf=1LL<<60 ; const ll mod=1e9+7 ; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef complex Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair P; typedef pair LDP; typedef pair LP; #define fr first #define sc second #define all(c) c.begin(),c.end() #define pb push_back #define debug(x) cout << #x << " = " << (x) << endl; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } //#define int long long void solve() { int n; cin >> n; bool is_prime = true, is_heihosu = false, is_ripposu = false; int divsum = 0; for(int i = 1; i * i <= n; i++) { if(n % i == 0) { is_prime = false; if(i * i != n) { divsum += i + n / i; } else { is_heihosu = true; divsum += i; } } if(i * i * i == n) { is_ripposu = true; } } if(is_prime) cout << "Sosu!" << endl; else if(is_heihosu) cout << "Heihosu!" << endl; else if(is_ripposu) cout << "Ripposu!" << endl; else if(divsum == n) cout << "Kanzensu!" << endl; else cout << n << endl; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); //init(); solve(); //cout << "finish" << endl; return 0; }