import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write N=int(readline()) if N in (2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61): ans="Sosu!" elif N in (4,9,16,25,36,49): ans="Heihosu!" elif N in (8,27): ans="Ripposu!" elif N in (6,28): ans="Kanzensu!" else: ans=N print(ans)