from fractions import gcd
from datetime import date
from math import factorial
import functools
from heapq import*
from collections import deque
import collections
import math
from collections import defaultdict, Counter
import sys
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
inf = float("inf")


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors


def is_prime(n):
    if n == 1:
        return False

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False

    return True


def main():
    n = int(input())

    if is_prime(n):
        print("Sosu!")
        exit()

    for i in range(2, 9):
        if n == i ** 2:
            print("Heihosu!")
            exit()

    for i in range(2,4):
        if n == i ** 3:
            print("RIpposu!")
            exit()

    l = make_divisors(n)
    k = sum(l) - n
    if k == n:
        print("Kanzensu!")
        exit()
    print(n)


if __name__ == '__main__':
    main()