def isprime(p):
    if p <= 1:
        return False
    if p == 2:
        return True
    if p % 2 == 0:
        return False;
    lim = int(p**0.5)+1
    for q in range(3, lim, 2):
        if p % q == 0:
            return False
    return True

def issquare(n):
    f = (0,0,1,1,0,1,1,1,1,0,1,1,1,1,1,1)
    if f[n & 0xf]:
         return False
    l, r = 1, n
    while l <= r:
        m  = l + (r - l) // 2
        m2 = m * m
        if m2 < n:
            l = m + 1
        elif m2 > n:
            r = m - 1
        else:
            return True
    return False        

def iscubic(n):
    l, r = 1, n
    while l <= r:
        m  = l + (r - l) // 2
        m3 = m * m * m
        if m3 < n:
            l = m + 1
        elif m3 > n:
            r = m - 1
        else:
            return True
    return False        

# https://oeis.org/A000396
def isperfect(n):
    return  n in (
        6, 28, 496, 8128, 33550336, 8589869056,
        137438691328, 2305843008139952128,
        #2658455991569831744654692615953842176,
        #191561942608236107294793378084303638130997321548169216
    )

N = int(input())

if isprime(N):
    ans = 'Sosu!'
elif issquare(N):
    ans = 'Heihosu!'
elif iscubic(N):
    ans = 'Ripposu!'
elif isperfect(N):
    ans = 'Kanzensu!'
else:
    ans = N

print(ans)