#include <bits/stdc++.h>
using namespace std;
const long long int MOD = (pow(10, 9) + 7);
long long int dig(long long int N, long long int K) {
  long long int dig = 0;
  while (N) {
    dig++;
    N /= K;
  }
  return dig;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  long long int g = gcd(a, b);
  return a / g * b;
}
long long int f(long long int n) {
  if (n == 0 || n == 1)
    return 1;
  else
    return (n * f(n - 1));
}
long long int dignum(long long int N, long long int d) {
  long long int x = pow(10, d);
  N %= x;
  long long int y = pow(10, d - 1);
  N /= y;
  return N;
}
long long int divcnt(long long int N, long long int d) {
  long long int ans = 0;
  while (1) {
    if (N % d == 0) {
      ans++;
      N /= d;
    } else
      break;
  }
  return ans;
}
bool prime(long long int num) {
  if (num < 2)
    return false;
  else if (num == 2)
    return true;
  else if (num % 2 == 0)
    return false;
  double sqrtNum = sqrt(num);
  for (int i = 3; i <= sqrtNum; i += 2) {
    if (num % i == 0) return false;
  }
  return true;
}
vector<long long int> memo(pow(10, 6) + 1);
long long int fibo(long long int n) {
  if (n == 1)
    return 1;
  else if (n == 2)
    return 1;
  else if (memo[n] != 0)
    return memo[n];
  else
    return memo[n] = fibo(n - 1) + f(n - 2);
}
long long int RS(long long int N, long long int P, long long int M) {
  if (P == 0) return 1;
  if (P % 2 == 0) {
    long long int t = RS(N, P / 2, M);
    return t * t % M;
  }
  return N * RS(N, P - 1, M);
}
int main() {
  long long int N;
  cin >> N;
  if (N == 3)
    cout << "bon" << endl;
  else if (N == 0 || N == 1 || N == 6 || N == 8)
    cout << "pon" << endl;
  else
    cout << "hon" << endl;
}
