import java.util.*; import java.util.Scanner; public class Main { public static void main (String[] args) { Scanner in = new Scanner(System.in); List list = new ArrayList<>(); int N = in.nextInt(); int a = (int)Math.sqrt(N); // square number if(isPrime(N)){ System.out.println("Sosu!"); }else if(isSQnum(N, a)){ System.out.println("Heihosu!"); }else if(isQubicNum(N)){ System.out.println("Ripposu!"); }else if(isPerfect(N)){ System.out.println("Kanzensu!"); }else{ System.out.println(N); } } static boolean isPrime(int N){ if(N == 2) return true; else{ // N(判定する数)までで、割り切れる数があれば、 // それは素数ではない for(int i=2; i=2 && a*a == N){ return true; } return false; } static boolean isQubicNum(int N){ if(Math.pow(N, 1.0 / 3) >= 2.0){ double root = Math.pow(N, 1.0 / 3); if(root - Math.floor(root) == 0) return true; else return false; } return false; } static boolean isPerfect(int N){ int sum = 0; for(int i=1; i