def is_prime(N):
    if N < 2 or N % 2 == 0:
        return (N == 2)
    i = 3
    while i * i <= N:
        if N % i == 0:
            return False
        i += 2
    return True

def divisors(N):
    U = int(N ** 0.5) + 1
    L = [i for i in range(1, U) if N % i == 0]
    return L + [N // i for i in reversed(L) if N != i * i]


N = int(input())

if is_prime(N):
    print("Sosu!")
elif int(N ** 0.5) ** 2 == N:
    print("Heihosu!")
elif int(N ** (1 / 3)) ** 3 == N:
    print("Ripposu!")
elif sum(divisors(N)) == 2 * N:
    print("Kanzensu!")
else:
    print(N)