#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <cstring>
#include <cstdint>
#include <vector>
#include <algorithm>
#include <cmath>
#include<iomanip>
#include <unordered_map>
#include <map>
using namespace std;
static const long long MOD = 1000000007LL;
typedef long long ll;
unordered_map <string,int> ump;
 
 
int main()
{
    ll n;
    cin>>n;
    ll sum=0;
    bool a2=false;
    bool a3=false;
    for(ll i=1;i<=(n/2);i++)
    {
    	if(n%i==0)
    		sum+=i;
    	if(n/i==i&&n%i==0&&n>2)
    		a2=true;
    	if(n/i/i==i&&n%i==0&&n%(i*i)==0&&n>2)
    		a3=true;
    }
    if(sum==1)
    	cout<<"Sosu!"<<endl;
    else if(sum==n)
    	cout<<"Kanzensu!"<<endl;
    else if(a2==true)
    	cout<<"Heihosu!"<<endl;
    else if(a3==true)
    	cout<<"Ripposu!"<<endl;
    else
    	cout<<n<<endl;
    return 0;
}