def isPrime(n):  # nが素数か判定する
    if n == 0 or n == 1:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    for i in range(3, int(n ** 0.5) + 1, 2):
        if n % i == 0:
            return False
    return True


def is_square(n):
    i = 1
    while True:
        if i * i == n:
            return True
        elif i * i > n:
            return False
        i += 1
    return False


def is_cube(n):
    i = 1
    while True:
        if i * i * i == n:
            return True
        elif i * i * i > n:
            return False
        i += 1
    return False


def is_perf(n):
    cnt = 0
    for i in range(1, n):
        if n % i == 0:
            cnt += i
    return n == cnt


def judge(n):
    if n < 2:
        print(n)
        return
    if isPrime(n):
        print("Sosu!")
        return
    if is_square(n):
        print("Heihosu!")
        return
    if is_cube(n):
        print("Ripposu!")
        return
    if is_perf(n):
        print("Kanzensu!")
        return
    print(n)


if __name__ == "__main__":
    n = int(input())
    judge(n)