#include<bits/stdc++.h>
using namespace std;

#define V vector
typedef long long ll;
typedef unsigned long long ull;

typedef V<int> vi;
typedef V<ll> vll;
typedef V<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define f(i,a) for(int i = 0 ; i < a ; i++)
#define fll(i,a) for(ll i = 0 ; i < a ;i++)
#define forab(i,a,b) for(int i = a ; i < b ; i++)
#define prec(x) cout<<fixed<<setprecision(x)
#define ff first
#define ss second

#define pb push_back
#define mp make_pair
#define numberofdigits(x) floor(log10(x)) + 1
#define M 1000000007

long long binpow(long long a, long long b) {
	long long res = 1;
	while (b > 0) {
		if (b & 1)
			res = (res * a) % M;
		a = (a * a) % M;
		b >>= 1;
	}
	return res;
}

auto sgn = [&](int x) {
	if (x > 0) return 1;
	else return -1;
};

void solve()
{
	int n;
	cin >> n;

	set<int> hon = { 2 , 4 , 5 , 7 , 9 };
	set<int> pon = {0 , 1 , 6 , 8};
	set<int> bon = {3};

	int d = n % 10;

	if (hon.count(d) > 0)
	{
		cout << "hon\n";
		return;
	}

	if (pon.count(d) > 0)
	{
		cout << "pon\n";
		return;
	}

	if (bon.count(d) > 0)
	{
		cout << "bon\n";
		return;
	}
}

int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int t = 1;
	//cin>>t;
	while (t--)
		solve();

	return 0;
}
