#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long expo(long long base, long long exponent, long long mod) {
  long long ans = 1;
  while (exponent != 0) {
    if (exponent & 1) ans = (1LL * ans * base) % mod;
    base = (1LL * base * base) % mod;
    exponent >>= 1;
  }
  return ans % mod;
}
vector<bool> prime(90000002, true);
void Sieve() {
  for (int p = 2; p * p <= 90000001; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= 90000001; i += p) prime[i] = false;
    }
  }
}
const long long M = 200006;
long long f[M], inv[M];
void compute() {
  f[0] = 1;
  for (long long i = 1; i <= M - 1; i++) {
    f[i] = (1LL * i * f[i - 1]) % mod;
  }
  inv[M - 1] = expo(f[M - 1], mod - 2, mod);
  for (long long i = M - 2; i >= 0; i--) {
    inv[i] = (1LL * (i + 1) * inv[i + 1]) % mod;
  }
}
long long C(long long n, long long r) {
  return (1LL * ((1LL * f[n] * inv[r]) % mod) * inv[n - r]) % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long tests = 1;
  while (tests--) {
    long long n;
    cin >> n;
    n %= mod;
    if (n == 3)
      cout << "bon";
    else if (n == 0 || n == 1 || n == 6 || n == 8)
      cout << "pon";
    else
      cout << "hon";
  }
  return 0;
}
