import math 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 sieve_of_eratosthenes(n): prime = [True for i in range(n+1)] prime[0] = False prime[1] = False sqrt_n = math.ceil(math.sqrt(n)) for i in range(2, sqrt_n): if prime[i]: for j in range(2*i, n+1, i): prime[j] = False return prime n = int(input()) hei = [(i+1)**2 for i in range(1,7)] rip = [(i+1)**3 for i in range(1,3)] pri = sieve_of_eratosthenes(n) div = make_divisors(n) if n in hei: print("Heihosu!") elif n in rip: print("Ripposu!") elif pri[n] == True: print("Sosu!") elif sum(div)-n == n: print("Kanzensu!") else: print(n)