#include <bits/stdc++.h>
using namespace std;
double pi = 3.1415926535897932384626433;
long long MOD = 1000000007;
long long C[2005][2005];
long long min(long long a, long long b) { return a < b ? a : b; }
long long pw(long long a, long long b) {
  if (b == 0) return 1;
  long long x = pw(a, b / 2);
  x = (x * x) % MOD;
  if (b % 2) x = (x * a) % MOD;
  return x % MOD;
}
long long comb2(long long n, long long k, long long x) {
  long long res = 1LL;
  if (k > n - k) k = n - k;
  for (int i = 0; i < k; ++i) {
    res = (res % MOD * (n - i) % MOD) % MOD;
    res = (res % MOD * pw((i + 1), MOD - 2) % MOD) % MOD;
  }
  return res % MOD;
}
void comb(long long n, long long k) {
  long long i, j;
  for (i = 0; i <= n; i++) {
    for (j = 0; j <= min(i, k); j++) {
      if (j == 0 || j == i)
        C[i][j] = 1LL;
      else
        C[i][j] = (C[i - 1][j - 1] % MOD + C[i - 1][j] % MOD) % MOD;
    }
  }
}
long long phi(long long n) {
  long long result = n;
  for (long long p = 2; p * p <= n; ++p) {
    if (n % p == 0) {
      while (n % p == 0) n /= p;
      result -= result / p;
    }
  }
  if (n > 1) result -= result / n;
  return result;
}
long long cc(long long n) {
  switch (n & 3) {
    case 0:
      return n;
    case 1:
      return 1;
    case 2:
      return n + 1;
    case 3:
      return 0;
  }
}
long long pp(string s) {
  reverse(s.begin(), s.end());
  int res = 0;
  for (int i = 0; i < s.length(); i++) res += (s[i] - '0') * pow(10, i);
  return res;
}
bool check(long long aa[], long long bb[], long long n) {
  for (long long i = 0; i < n; i++)
    if (aa[i] != bb[i]) return true;
  return false;
}
void solve() {
  std::ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  t = 1;
  while (t--) {
    string s;
    cin >> s;
    if (s[1] == '0' or s[1] == '1' or s[1] == '6' or s[1] == '8')
      cout << "pon";
    else if (s[1] == '3')
      cout << "bon";
    else
      cout << "hon";
  }
}
int main() {
  std::ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
}
