#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 1e5 + 4;
const long long MOD = 998244353;
bool visited[N];
vector<int> edge[N];
vector<int> conc[N];
int c = 0;
long long POW(long long base, long long exponent) {
  long long result = 1;
  while (exponent > 0) {
    if (exponent % 2 == 1) result = (result * base) % mod;
    exponent = exponent >> 1;
    base = (base * base) % mod;
  }
  return result;
}
long long Inv(long long x) { return POW(x, MOD - 2); }
void DFS(int src) {
  visited[src] = 1;
  conc[c].push_back(src);
  for (auto i : edge[src]) {
    if (!visited[i]) DFS(i);
  }
}
void BFS(int s, vector<int> &d) {
  d[s] = 0;
  queue<int> q;
  q.push(s);
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (auto to : edge[v]) {
      if (d[to] == N) {
        d[to] = d[v] + 1;
        q.push(to);
      }
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  n = n % 10;
  if (n == 3)
    cout << "bon";
  else if (n == 0 or n == 1 or n == 6 or n == 8)
    cout << "pon";
  else
    cout << "hon";
  return 0;
}
