#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
int gcd(int x, int y) {
  if (x % y == 0)
    return y;
  else
    return gcd(y, x % y);
}
bool isPrime(int n) {
  if (n < 2)
    return false;
  else if (n == 2)
    return true;
  else if (n % 2 == 0)
    return false;
  for (int i = 3; i <= sqrt(n); i++) {
    if (n % i == 0) return false;
  }
  return true;
}
string n;
int main() {
  cin >> n;
  if (n[0] == '3')
    cout << "bon" << endl;
  else if (n[0] == '0' || n[0] == '1' || n[0] == '6' || n[0] == '8')
    cout << "pon" << endl;
  else
    cout << "hon" << endl;
}
