#include <bits/stdc++.h>
int gcd(int m, int n) {
  if ((0 == m) || (0 == n)) return 0;
  while (m != n)
    if (m > n)
      m = m - n;
    else
      n = n - m;
  return m;
}
int lcm(int m, int n) {
  if ((0 == m) || (0 == n)) return 0;
  return (m * n / gcd(m, n));
}
int fact(int x) {
  if (x == 1)
    return (x);
  else
    return (x * fact(x - 1));
}
int ruijou(int base, int exponent) {
  int i, answer = 1;
  i = exponent;
  while (i != 0) {
    answer = answer * base;
    --i;
  }
  return answer;
}
long long int llgcd(long long int m, long long int n) {
  if ((0 == m) || (0 == n)) return 0;
  while (m != n)
    if (m > n)
      m = m - n;
    else
      n = n - m;
  return m;
}
long long int lllcm(long long int m, long long int n) {
  if ((0 == m) || (0 == n)) return 0;
  return (m * n / llgcd(m, n));
}
long long int llfact(long long int x) {
  if (x == 1)
    return (x);
  else
    return (x * llfact(x - 1));
}
int llruijou(long long int base, long long int exponent) {
  long long int i, answer = 1;
  i = exponent;
  while (i != 0) {
    answer = answer * base;
    --i;
  }
  return answer;
}
int main() {
  int n;
  scanf("%d", &n);
  if (n % 10 == 2, n % 10 == 4, n % 10 == 5, n % 10 == 7, n % 10 == 9)
    printf("hon\n");
  if (n % 10 == 0, n % 10 == 1, n % 10 == 6, n % 10 == 8) printf("pon\n");
  if (n % 10 == 3) printf("bon\n");
  return 0;
}
