#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000050;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const long long linf = 2e18;
long long power(long long x, long long y) {
  long long ans = 1;
  while (y) {
    if (y & 1) ans = ans * x % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd(long long x, long long y) {
  if (x % y == 0) return y;
  return gcd(y, x % y);
}
char a[20][20];
int main() {
  int i, j, k, m, t, n;
  for (i = 0; i < 9; i++) {
    a[i][0] = 'h';
    a[i][1] = 'o';
    a[i][2] = 'n';
    a[i][3] = '\0';
    if (i == 0 || i == 1 || i == 6 || i == 8) a[i][0] = 'p';
    if (i == 3) a[i][0] = 'b';
  }
  scanf("%d", &n);
  printf("%s\n", a[n % 10]);
  return 0;
}
