#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define MOD  1000000007
#define inf  1e18
#define ll long long
#define multiply(x) x*x*(x-=1)

#define ar array
#define wt(x) int x;cin>>x;while(x--)
typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update> pbds;
 void  c_p_c(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
 
#ifndef ONLINE_JUDGE
  freopen("input1.txt","r",stdin);
  freopen("output1.txt","w",stdout);
#endif
 
 
}
void solve(int l){

   int n,k;
   cin>>n>>k;
   int arr[n];
   string s;
   for(int i=0;i<n;i++){
    cin>>arr[i];
    
}

            




    cout<< "Case #"<<l<<": ";
    cout<<ans<<"\n";
   }


int32_t main() {
   c_p_c();
  
       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;
 }