n = int(input())
L = [0]*64

import math

def is_prime(n):
    if n == 1:
        return False

    for i in range(2, int(math.sqrt(n))+1):
        if n%i == 0:
            return False

    return True

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    #divisors.sort(reverse=True)
    return divisors

for i in range(64):
    if i == 0:
        continue
    else:
        d = make_divisors(i)
        if sum(d)-i == i:
            L[i] = 'Kanzensu!'

for i in range(2, 4):
    L[i**3] = 'Ripposu!'

for i in range(2, 8):
    L[i**2] = 'Heihousu!'

for i in range(64):
    if i == 0:
        continue
    else:
        if is_prime(i):
            L[i] = 'Sosu!'

if L[n] != 0:
    print(L[n])
else:
    print(n)