from collections import Counter
from math import sqrt
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

N = int(input())
if N == 1:
  print(N)
  exit()
P = Counter(prime_factorize(N))
kanzen = 1
for n,K in P.items():
  count = 0
  for k in range(K+1):
    count += n**k
  kanzen *= count
if (kanzen-N) == N:
  print("Kanzensu!")
  exit()
PV = list(P.values())
if PV[0] == 3 and len(PV) == 1:
  print("Ripposu!")
  exit()
if sqrt(N).is_integer():
  print("Heihosu!")
  exit()
PK = list(P.keys())
if PK[0] == N:
  print("Sosu!")
  exit()
print(N)