def is_prime(x):
    if x <= 1:
        return False
    for i in range(2,int(-(-x**0.5)//1)+1):
        if x%i == 0:
            return False
    return x != 1

def f_1(x):
    for i in range(2,x+1):
        if i * i == x:
            return True
            break
    return False
    
def f_2(x):
    for i in range(2,x+1):
        if i * i * i == x:
            return True
            break
    return False
    
def divisor(y):
    i=1
    table=[]
    while i * i <= y:
        if y%i == 0:
            table.append(i)
            table.append(y//i)
        i+=1        
    table=list(set(table))
    return sum(table[:-1])
    

n=int(input())
if n==0:
    print(0)
    exit()

if is_prime(n):
    print('Sosu!')
elif f_1(n):
    print('Heihosu!')
elif f_2(n):
    print('Ripposu!')
elif divisor(n)==n:
    print('Kanzensu!')
else:
    print(n)