#include <bits/stdc++.h>
using namespace std;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 62;
const long long MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s) {
  return f.second > s.second;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long conbinationMemo[100][100];
void cmemoInit() {
  for (int i = 0; i < (int)(100); i++) {
    for (int j = 0; j < (int)(100); j++) {
      conbinationMemo[i][j] = -1;
    }
  }
}
long long nCr(long long n, long long r) {
  if (conbinationMemo[n][r] != -1) return conbinationMemo[n][r];
  if (r == 0 || r == n) {
    return 1;
  } else if (r == 1) {
    return n;
  }
  return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
long long nPr(long long n, long long r) {
  r = n - r;
  long long ret = 1;
  for (long long i = n; i >= r + 1; i--) ret *= i;
  return ret;
}
int main(void) {
  int n;
  cin >> n;
  bool p = false;
  string s = to_string(n);
  int f = s[s.size() - 1] - '0';
  switch (f) {
    case 0:
      p = true;
      break;
    case 1:
      p = true;
      break;
    case 2:
      p = false;
      break;
    case 3:
      p = false;
      break;
    case 4:
      p = false;
      break;
    case 5:
      p = false;
      break;
    case 6:
      p = true;
      break;
    case 7:
      p = false;
    case 8:
      p = true;
      break;
    case 9:
      p = false;
      break;
  }
  if (f == 3) {
    cout << "bon" << endl;
  } else if (p) {
    cout << "pon" << endl;
  } else {
    cout << "hon" << endl;
  }
}
