#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
ll cnt_rep = 0;
ll powmod(ll N, ll P, ll M) {
  cnt_rep++;
  if (P == 0) return 1;
  if (P % 2 == 0) {
    ll t = powmod(N, P / 2, M);
    return t * t % M;
  }
  return (N * powmod(N, P - 1, M)) % M;
}
ll gcd(ll a, ll b) {
  ll resi, g, l;
  if (a > b) {
    g = a;
    l = b;
  } else if (b > a) {
    g = b;
    l = a;
  } else {
    return a;
  }
  resi = g % l;
  if (resi != 0) {
    return gcd(l, resi);
  } else {
    return l;
  }
}
template <typename T>
void remove(std::vector<T> &vector, unsigned int index) {
  vector.erase(vector.begin() + index);
}
int ans = 0;
int N, M, Q;
template <typename T>
void showall(vector<T> v) {
  for (int i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
  cout << endl;
}
template <typename T>
ll com(T n, T m, T mod) {
  ll a = 1, b = 1, ans;
  if (n == m || m == 0) {
    ans = 1;
  } else {
    for (ll i = 0; i < m; i++) {
      a *= n - i;
      a %= mod;
      b *= i + 1;
      b %= mod;
    }
    ans = (a * powmod(b, mod - 2, mod)) % mod;
  }
  return ans;
}
int main() {
  string N, ans;
  cin >> N;
  int len = N.length() - 1;
  if (N[len - 1] == '0' || N[len - 1] == '1' || N[len - 1] == '6' ||
      N[len - 1] == '8') {
    ans = "pon";
  } else if (N[len - 1] == '3') {
    ans = "bon";
  } else {
    ans = "hon";
  }
  cout << ans << endl;
}
