#include <bits/stdc++.h>
#define rep(i,n); for(int i = 0;i < (n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

// 最小公倍数を求める
int euqlid (int a, int b){
  int temp;
  temp = a % b;
  if(temp == 0)return b;
  return euqlid(b,temp);
}
ll conbination(ll a,ll b){
  ll u = 1;
  ll d = 1;
  while(b != 0){
    u *= a;
    d *= b;
    a--;
    b--;
  }
  return u / d;
}
int strtoint(char s){
  return (int(s-'0'));
}
int fact(int n){
  if(n == 1)return 1;
  return n * fact(n-1);
  }


int main(){
  string n;
  cin >> n;
  string ans;
  int len = n.size()-1;
  if(strtoint(n[len]) == 0 or strtoint(n[len]) == 1 or strtoint(n[len]) ==6 or strtoint(n[len]) ==8)ans = "pon";
  else if(strtoint(n[len]) == 2 or strtoint(n[len]) ==4 or strtoint(n[len]) ==5 or strtoint(n[len]) ==7 or strtoint(n[len]) ==9)ans = "hon";
  else if(strtoint(n[len]) == 3)ans = "bon";
  cout << ans << endl;

}