n=int(input())
if n==0:
    print(0)
    exit()
import math
def isprime(n):
    if n < 2:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    for i in range(3, int(math.sqrt(n)) + 1, 2):
        if n % i == 0: return False
    return True
if isprime(n):
    print('Sosu!')
    exit()
if n in [4,9,16,25,36,49,64]:
    print('Heihosu!')
    exit()
if n in [8,27,64]:
    print('Ripposu!')
    exit()
def make_divisors(n):
    lower_divisors,upper_divisors=[],[]
    i=1
    while i*i<=n:
        if n%i==0:
            lower_divisors.append(i)
            if i!=n//i:
                upper_divisors.append(n//i)
        i+=1
    return lower_divisors+upper_divisors[::-1]
if sum(make_divisors(n))==2*n:
    print('Kanzensu!')
    exit()
print(n)