#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.141592653589793238462643383;
int Ceil(int a, int b) {
  if (a % b == 0)
    return a / b;
  else
    return (a / b) + 1;
}
long long p = 1000000007;
float E = 0.00000000000001;
long long power(long long x, long long y) {
  if (y == 0) {
    return 1;
  }
  if (y % 2 == 0) {
    long long q = power(x, y / 2);
    q = q % p;
    return (q * q) % p;
  }
  long long q = power(x, y / 2);
  q = q % p;
  return ((x % p) * ((q * q) % p)) % p;
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
bool isPowerOfTwo(int x) { return x && (!(x & (x - 1))); }
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int mod(long long int a, long long int b) {
  long long int ret = a % b;
  return ret >= 0 ? ret : ret + b;
}
int powerCount(int num, int x) {
  int count = 0;
  while (!(num % x)) {
    count++;
    num /= x;
  }
  return count;
}
vector<int> SieveOfEratosthenes(int n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  vector<int> vec;
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  for (int p = 2; p <= n; p++)
    if (prime[p]) {
      vec.push_back(p);
    }
  return vec;
}
int main() {
  int t;
  t = 1;
  while (t--) {
    int n;
    cin >> n;
    if (n % 10 == 2 || n % 10 == 4 || n % 10 == 5 || n % 10 == 7 || n % 10 == 9)
      cout << "hon";
    if (n % 10 == 0 || n % 10 == 1 || n % 10 == 6 || n % 10 == 8)
      cout << "pon";
    else
      cout << "bon";
  }
  return 0;
}
