#include <cstdio>
#include <cmath>
#include <iostream>

#define rep( i, n, m ) for (int i = ( n ); i < ( m ); i++)
#define rep_d( i, n, m ) for (i

int main( void ){
	int n;
	if (!scanf( "%d", &n ))
		return -1;
	float rt = std::sqrt( n );
	float cu_rt = std::pow( n, 1.0 / 3.0 );
	if (std::pow(rt, 2.0) == n){
		printf( "Heihosu!\n" );
		return 0;
	}
	if (std::pow(rt, 3.0) == n){
		printf( "Ripposu!\n" );
		return 0;
	}
	bool is_prime = true;
	int sum = 1;
	for(int i = 2; i <= rt; i++){
		int a = ( int )( n / i );
		if (n - i * a == 0){
			is_prime = false;
			sum += i + a;
		}
	}
	if (is_prime){
		printf( "Sosu!\n" );
		return 0;
	}
	else if (sum == n){
		printf( "Kanzensu!\n" );
		return 0;
	}
	printf( "%d\n", n );
	return 0;
}