#include <bits/stdc++.h>
using namespace std;
long long Ceil(long long a, long long b) {
  if (a % b == 0)
    return a / b;
  else
    return a / b + 1;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long inv(long long a) {
  long long p = 1000000007;
  long long b = p - 2, ans = 1;
  for (; b > 0; a = a * a % p, b >>= 1)
    if (b & 1) ans = ans * a % p;
  return ans;
}
long long ncrmod(long long n, long long m) {
  long long p = 1000000007;
  if (m > n) return 0;
  long long up = 1, down = 1;
  for (long long i = n - m + 1; i < n + 1; i++) up *= i, up %= p;
  for (long long i = 1; i < m + 1; i++) down *= i, down %= p;
  return up * inv(down) % p;
}
long long powmod(long long a, long long n) {
  if (!n) return 1;
  long long pt = powmod(a, n / 2);
  pt *= pt, pt %= 1000000007;
  if (n & 1) pt *= a, pt %= 1000000007;
  return pt;
}
bool SieveOfEratosthenes(long long n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (long long p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  return prime[n];
}
void solve() {
  long long n;
  cin >> n;
  n = n % 10;
  if (n == '2' or n == '4' or n == '5' or n == '7' or n == '9') {
    cout << "hon";
  }
  if (n == '0' or n == '1' or n == '6' or n == '8') {
    cout << "pon";
  }
  if (n == '3') {
    cout << "bon";
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t;
  t = 1;
  while (t--) {
    solve();
  }
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
