package main

import "fmt"

func divisors(n int) (r []int) {
	r = make([]int, 0)
	for i := 1; i*i <= n; i++ {
		if n%i == 0 {
			r = append(r, i)
			if i*i != n {
				r = append(r, n/i)
			}
		}
	}
	return r
}

func primeNum(N int) []bool {
	r := make([]bool, N+1)
	for i := range r {
		r[i] = true
	}
	r[0] = false
	r[1] = false
	for i := 2; i*i <= N; i++ {
		for j := i * 2; j <= N; j += i {
			if r[j] {
				r[j] = false
			}
		}
	}
	return r
}

func isPrime(N int) bool {
	primes := primeNum(N)
	// fmt.Println("isPrime - primes", primes)
	if primes[N] {
		return true
	}
	return false
}

func isHeihosu(N int) bool {
	for i := 1; i*i <= N; i++ {
		if i*i == N {
			return true
		}
	}
	return false
}
func isRipposu(N int) bool {
	for i := 1; i*i*i <= N; i++ {
		if i*i*i == N {
			return true
		}
	}
	return false
}
func isKanzensu(N int) bool {
	divs := divisors(N)
	tot := 0
	for _, v := range divs {
		if v != N {
			tot += v
		}
	}
	if tot == N {
		return true
	}
	return false
}

func main() {
	var N int
	fmt.Scan(&N)
	ans := ""
	if N == 0 || N == 1 {
		fmt.Println(N)
		return
	}
	if isPrime(N) {
		ans = "Sosu!"
	} else if isHeihosu(N) {
		ans = "Heihosu!"
	} else if isRipposu(N) {
		ans = "Ripposu!"
	} else if isKanzensu(N) {
		ans = "Kanzensu!"
	} else {
		fmt.Println(N)
		return
	}
	fmt.Println(ans)
}