#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace std;
using namespace __gnu_pbds;   
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update> 
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#define all(x) x.begin(),x.end()
#define sz(x) (ll)x.size() 

ll power(ll x,ll y,ll p) 
{ 
    ll res = 1;      
    x = x % p;  
    while (y > 0) 
    { 
        if (y & 1) 
            res = (res*x) % p; 
        y = y>>1; 
        x = (x*x) % p;   
    } 
    return res; 
} 

int main()
{
    ios_base::sync_with_stdio(false);
	ll n,i,j,k,x,y,t,m;

	string s;
	cin >> s;
	if(s[sz(s)-1]=='2' || s[sz(s)-1]=='4' || s[sz(s)-1]=='5' || s[sz(s)-1]=='7' || s[sz(s)-1]=='9')
		cout<<"hon"<<endl;
	if(s[sz(s)-1]=='0' || s[sz(s)-1]=='1' || s[sz(s)-1]=='6' || s[sz(s)-1]=='8' )
		cout<<"bon"<<endl;
	if(s[sz(s)-1]=='3')
		cout<<"pon"<<endl;
}