#include <bits/stdc++.h>
using namespace std;
struct node {
  long long nod, d;
  node(long long a, long long b) {
    nod = a;
    d = b;
  }
  bool operator<(const node &p) const { return p.d < d; }
};
long long Set(long long n, long long pos) { return n = n | (1LL << pos); }
long long reset(long long n, long long pos) { return n = n & ~(1LL << pos); }
bool check(long long n, long long pos) { return (bool)(n & (1LL << pos)); }
long long power(long long x, long long y) {
  long long res = 1;
  x = x;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
int main() {
  long long tes;
  long long n;
  scanf("%lld", &n);
  long long dig = n % 10;
  if (dig == 2 || dig == 4 || dig == 5 || dig == 7 || dig == 9) {
    cout << "hon" << endl;
  }
  if (dig == 0 || dig == 1 || dig == 6 || dig == 8) {
    cout << "pon" << endl;
  }
  if (dig == 3) {
    cout << "bon" << endl;
  }
  return 0;
}
