#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define mod 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
int main(){
    int n;
    cin >> n;
    if(n==6||n==28){
        cout << "Kanzensu!" << endl;
    }else if(n==4||n==9||n==16||n==25||n==36||n==49){
        cout << "Heihosu!" << endl;
    }else if(n==8||n==27){
        cout << "Ripposu!" << endl;
    }else if(n==2||n==3||n==5||n==7||n==11||n==13||n==17||n==19||n==23||n==29||n==31||n==37||n==41||n==43||n==47||n==53||n==59||n==61){
        cout << "Sosu!" << endl;
    }else{
        cout << n << endl;
    }
    return 0;
}