import java.util.*; public class Main { public static void main (String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); if (n == 64) { System.out.println(64); return; } if (isPrime(n)) { System.out.println("Sosu!"); } else if (isHeiho(n)) { System.out.println("Heihosu!"); } else if (isRippo(n)) { System.out.println("Ripposu!"); } else if (isKanzen(n)) { System.out.println("Kanzensu!"); } else { System.out.println(n); } } static boolean isPrime(int n) { if (n <= 1) { return false; } for (int i = 2; i <= Math.sqrt(n); i++) { if (n % i == 0) { return false; } } return true; } static boolean isHeiho(int n ) { for (int i = 2; i * i <= n; i++) { if (i * i == n) { return true; } } return false; } static boolean isRippo(int n ) { for (int i = 2; i * i * i <= n; i++) { if (i * i * i== n) { return true; } } return false; } static boolean isKanzen(int n) { int sum = 1; for (int i = 2; i < n; i++) { if (n % i == 0) { sum += i; } } return sum == n; } static int getCount(long n, int k) { int idx = 0; while (n > 0) { n -= (long)(Math.pow(k, idx)); idx++; } return idx - 1; } }