#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 
 
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;

vector<int> pp;
void preparePrime( int maxp )
{
    int i;
    vector<int> a(maxp+1);
    for(i=2; i<=maxp; i++) {
        int k=i+i;
        while(k<=maxp) {
            a[k]=1;
            k+=i;
        }
    }
    for(i=2; i<=maxp; i++) {
        if(a[i]==0) pp.push_back( i );
    }
    return;
}

void decompositPrime( ll a, vector<pair<ll,ll> >& vv )
{
    preparePrime( (int)sqrt((double)a)+1 );

    int i;
    for(i=0; i<(int)pp.size(); i++) {
        int count = 0;
        while(a % pp[i] == 0 ) {
            a /= pp[i];
            count ++;
        }
        if(count>0) vv.push_back( make_pair( pp[i], count ) );
        if (a==1) break;
    }
    if(a>1) {
        vv.push_back( make_pair( a, 1 ) );
    }

    return;
}

int main(int argc, char* argv[])
{
    ll n;
    scanf("%lld", &n);

    int m=(int)sqrt((double)n+0.1);
    if(m*m==n) {
        printf("Heihosu!\n"); return 0;
    }
    m=(int)(pow((double)n, (double)1/3)+0.1);
    if(m*m*m==n) {
        printf("Ripposu!\n"); return 0;
    }

    vector<pair<ll,ll> > vv;
    decompositPrime( n, vv );

    int siz=(int)vv.size();
    if(siz==1 && vv[0].second==1) {
        printf("Sosu!\n"); return 0;
    }

    int i, k;
    ll ans=1;
    for(i=0; i<siz; i++) {
        ll sum=0;
        ll curr=1;
        for(k=0; k<=vv[i].second; k++) {
            if(k>0) curr*=vv[i].first;
            sum += curr;
        }
        ans *= sum;
    }
    if(n*2==ans) {
        printf("Kanzensu!\n");
    }
    else {
        printf("%lld\n", n);
    }   


    return 0;
}