#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define int long long #define rep(i, n) for (int i = 0; i < (n); i++) #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define FORR(i,a,b)for(int i=(a);i<=(b);i++) #define repR(i,n) for(int i=n;i>=0;i--) #define P pair #define sz(x) x.size() #define ALL(x) (x).begin(),(x).end() #define ALLR(x) (x).rbegin(),(x).rend() #define VE vector #define COUT(x) cout<<(x)< #define SE set #define PQ priority_queue #define COUT(x) cout<<(x)< inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } using namespace std; typedef long long ll; using Graph = vector>; ll gcd(ll a, ll b) { if (a < b)swap(a, b); if (b == 0) return a; return gcd(b, a % b); } ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g * b; } bool prime(int n) { for (int i = 2; i <= sqrt(n); i++) { if (n%i == 0)return false; } return n != 1; } bool compare_by_b(pair a, pair b) { if (a.second != b.second) { return a.second < b.second; } else { return a.first < b.first; } } const long long MOD = 1000000007; const long long INF = 1LL << 50; // pair -> vector> // AandB.push_back(make_pair(a[i],b[i])) signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; if (n == 1) { cout << 1 << endl; return 0; } if (prime(n)) { cout << "Sosu!" << endl; return 0; } for (int i = 1; i <= 8; i++) { if (i*i == n) { cout << "Heihosu!" << endl; return 0; } } for (int i = 1; i <= 8; i++) { if (i*i*i == n) { cout << "Ripposu!" << endl; return 0; } } int sum = 0; sets; for (int i = 1; i <= sqrt(n); i++) { if (n%i == 0) { s.insert(i); s.insert(n / i); } } for (auto x : s) { sum += x; } sum -= n; if (sum == n) { cout << "Kanzensu!" << endl; return 0; } cout << n << endl; return 0; }