def is_prime(x):
    flg = True
    for i in range(2, int(x**0.5)+1):
        if x%i==0:
            flg = False
            break
    return flg

def prime_decomposition(x):
    ret = []
    for i in range(1, int(x**0.5)+1):
        if x%i==0:
            ret.append(i)
            if i!=x//i:
                ret.append(x//i)
    return sorted(ret)

n = int(input())
if n==0 or n==1:
    print(n)
elif is_prime(n):
    print('Sosu!')
elif n>=2 and int(n**0.5)**2 == n:
    print('Heihosu!')
elif n in [8, 27, 64]:
    print('Ripposu!')
elif sum(prime_decomposition(n))==n*2:
    print('Kanzensu!')
else:
    print(n)