#include <bits/stdc++.h>
using namespace std;
long long inf = 1e9 + 7;
bool isprime(long long a) {
  long long cnt = 0;
  for (long long i = 1; i * i < a; i++) {
    if (a % i == 0) {
      cnt += 2;
    }
  }
  if (cnt == 2)
    return true;
  else
    return false;
}
long long mod(long long a) {
  if (a < inf)
    return a;
  else
    return a % inf;
}
void solve() {
  long long n;
  cin >> n;
  if (n == 3) {
    cout << "bon";
  } else if (n == 0 || n == 1 || n == 6 || n == 8) {
    cout << "pon";
  } else
    cout << "hon";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
