#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
long long int it = 0, ans = 0;
long long int spf[100001];
void sieve() {
  spf[1] = 1;
  for (auto i = 2; i < 100001; i++) spf[i] = i;
  for (auto i = 4; i < 100001; i += 2) spf[i] = 2;
  for (auto i = 3; i * i < 100001; i++) {
    if (spf[i] == i) {
      for (auto j = i * i; j < 100001; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
  return;
}
vector<long long int> getFactorization(long long int x) {
  vector<long long int> ret;
  while (x != 1) {
    ret.push_back(spf[x]);
    x = x / spf[x];
  }
  return ret;
}
void check() {
  long long int n;
  cin >> n;
  n %= 10;
  if (n == 2 or n == 4 or n == 5 or n == 7)
    cout << "hon";
  else if (n == 0 or n == 1 or n == 6 or n == 8)
    cout << "pon";
  else if (n == 3)
    cout << "bon";
  return;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t = 1;
  while (t--) check();
  return 0;
}
