#include<bits/stdc++.h>
using namespace std;
#define M (int)1e9
#define pi 3.1415926536
 
vector <int> SieveOfEratosthenes(int n) 
{ 
    vector<int> ans;
    bool prime[n+1]; 
    memset(prime, true, sizeof(prime)); 
  
    for (int p=2; p*p<=n; p++) 
    if (prime[p] == true) 
    for (int i=p*p; i<=n; i += p) 
    prime[i] = false; 
        
  	for (int p=2; p<=n; p++) 
    if (prime[p]) 
    ans.push_back(p);
	return ans;
}
 
vector <int> fib(int n)
{
	vector<int> ans;
	int x=0,y=1,l=1;
	ans.push_back(x);
	ans.push_back(y);
	while(l<n)
	{
		l=x+y;
		x=y;y=l;
		ans.push_back(l);
	}
	return ans;
}
 
bool isPrime(int n) 
{ 
	if (n <= 1) return false; 
	if (n <= 3) return true; 
 
	if (n%2 == 0 || n%3 == 0) return false; 
 
	for (int i=5; i*i<=n; i=i+6) 
		if (n%i == 0 || n%(i+2) == 0) 
		return false; 
 
	return true; 
} 
 
 
long long power(int n,int k)
{
	if(k==0)	return 1;
	else return n*power(n,k-1);
}
 
int sdigit(int x)
{
	int ans=0;
	while(x)
	{
		ans+=x%10;
		x/=10;
	}
	return ans;
}
 
long long lcm(int a,int b)
{
	return ((long long)a*(long long)b)/__gcd(a,b);
}
 
 bool aisekaro(string a,string b)
 {
    //cout<<a<<endl<<b<<endl;
 	int i=0;
 	char x=a[0];
	for(i;i<max(a.size(),b.size());i++)
	{
	    //cout<<a[i]<<" "<<b[i]<<endl;
		if(i<min(a.size(),b.size())){	
			if(a[i]>b[i])	return true;
			if(a[i]<b[i])	return false;
			if(a[i]==b[i])  continue;
			
			//x=a[i];
		}
		if(i>=a.size()){
			if(b[i]==x)	continue;
			else return b[i]<x;
		}
		if(i>=b.size()){
			if(a[i]==x)	continue;
			else  return a[i]>x;
		}

	}
	return true;
 }
 long long subArraySum(int arr[], int n, int sum) 
{ 
    int curr_sum = arr[0], start = 0, i; 
  
    for (i = 1; i <= n; i++) 
    { 
        while (curr_sum > sum && start < i - 1) 
        { 
            curr_sum = curr_sum - arr[start]; 
            start++; 
        } 
  
        
        if (curr_sum == sum) 
        {  
            cout << "Sum found between indexes " 
                 << start << " and " << i - 1; 
            return 1; 
        } 
  
        if (i < n) 
        curr_sum = curr_sum + arr[i]; 
    } 
  
    return -1; 
} 
int main()
{
	#ifndef ONLINE_JUDGE
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
	#endif
	int n;
	cin>>n;
	if(n%10==3)	cout<<"bon";
	else if(n%10==0||n%10==1||n%10==6||n%10==8)
		cout<<"pon";
	else cout<<"hon";


	return 0;
			
}