#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
ll gcd(ll a, ll b) {
  if (b > a) swap(a, b);
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
  ll g = gcd(a, b);
  return a / g * b;
}
ll rep_jijo(ll n, ll x) {
  if (x == 0) return 1;
  if (x % 2 == 0) {
    ll t = rep_jijo(n, x / 2);
    return t * t % 1000000007;
  }
  return n * rep_jijo(n, x - 1) % 1000000007;
}
ll c2(ll n) { return n * (n - 1) / 2; }
int main() {
  int n, k;
  cin >> n;
  if (n < 10) {
    k = n;
  } else if (10 <= n) {
    k = n % 10;
  }
  if (k == 2 || 4 || 5 || 7 || 9) {
    cout << "hon" << endl;
  } else if (k == 0 || 1 || 6 || 8) {
    cout << "pon" << endl;
  } else {
    cout << "bon" << endl;
  }
  return 0;
}
