/* -*- coding: utf-8 -*-
 *
 * 889.cc:  No.889 素数! - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 64;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

/* global variables */

bool primes[MAX_N + 1];

/* subroutines */

void gen_primes(int maxp) {
  memset(primes, true, sizeof(primes));
  primes[0] = primes[1] = false;

  for (int p = 2; p * p <= maxp; p++)
    if (primes[p])
      for (int q = p * p; q <= maxp; q += p) primes[q] = false;
}

/* main */

int main() {
  int n;
  scanf("%d", &n);

  if (n >= 2) {
    gen_primes(n);
    if (primes[n]) {
      puts("Sosu!");
      return 0;
    }

    int sum = 0;
    for (int p = 1; p * p <= n; p++)
      if (n % p == 0) {
	sum += p;
	int q = n / p;
	if (q != p) sum += q;

	if (p * p == n) {
	  puts("Heihosu!");
	  return 0;
	}
	if (p * p * p == n) {
	  puts("Ripposu!");
	  return 0;
	}
      }

    if (sum - n == n) {
      puts("Kanzensu!");
      return 0;
    }
  }

  printf("%d\n", n);
  return 0;
}