#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  long long r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long *calc_z(string s) {
  long long n = s.size();
  long long *z = new long long[n]{0};
  long long l = 0, r = 0;
  for (long long i = 1; i < n; i++) {
    if (r >= i) z[i] = min(z[i - l], r - i + 1);
    while (z[i] + i < n && s[z[i]] == s[z[i] + i]) z[i]++;
    if (i + z[i] - 1 > r) {
      l = i;
      r = i + z[i] - 1;
    }
  }
  return z;
}
long long find_lower(long long *a, long long n, long long v) {
  long long l = -1, r = n;
  while (r > l + 1) {
    long long m = (l + r) / 2;
    if (a[m] >= v)
      r = m;
    else
      l = m;
  }
  if (r == n) return n - 1;
  if (a[r] == v) return r;
  return r == 0 ? 0 : r - 1;
}
void init() {}
int bin(int *p, int n, int x) {
  int l = 0, r = n - 1;
  while (r >= l) {
    int m = (l + r) / 2;
    if (p[m] == x) return m;
    if (p[m] > x)
      r = m - 1;
    else
      l = m + 1;
  }
  return -1;
}
void solve() {
  int n;
  cin >> n;
  int d = n % 10;
  if (d == 2 || d == 4 || d == 5 || d == 7)
    cout << "hon\n";
  else if (d == 3)
    cout << "bon\n";
  else
    cout << "pon\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
