#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
#include <functional>
using namespace __gnu_pbds; 
using namespace std;



typedef tree<long long, null_type, less<long long>, rb_tree_tag, 
             tree_order_statistics_node_update> 
    new_data_set; 
 
//defines
typedef long long ll;

    
ll solve(ll t)
{/*hon when the digit in the one's place of 
N
 is 
2
, 
4
, 
5
, 
7
, or 
9
;
pon when the digit in the one's place of 
N
 is 
0
, 
1
, 
6
 or 
8
;
bon when the digit in the one's place of 
N
 is 
3
.*/
    string s;cin>>s;
    ll n=s.size()-1;
    if(s[n]=='0' or s[n]=='1' or s[n]=='6' or s[n]=='8')cout<<"pon";
    else if(s[n]=='3')cout<<"bon";
    else cout<<"hon";
 if(t>0)cout<<"\n";

}

int32_t main()
{
#ifdef ONPC
    freopen("input.txt", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll t=1;
   // cin>>t;
    while(t--)
    {
        solve(t);
    }
    
        
    return 0;
}