#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<char, int> a, pair<char, int> b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first > b.first;
}
template <typename T>
T power(T a, T b) {
  if (b == 0) return 1;
  if (b == 1)
    return a;
  else {
    T res = (power(a, b / 2));
    if (b % 2) {
      return (res * res * a);
    } else {
      return res * res;
    }
  }
}
template <typename T>
T power(T a, T b, T modulo) {
  if (b == 0) return 1;
  if (b == 1)
    return a;
  else {
    T res = (power(a, b / 2, modulo) % modulo);
    if (b % 2) {
      return ((((res % modulo) * (res % modulo)) % modulo) * (a % modulo)) %
             modulo;
    } else {
      return ((res % modulo) * (res % modulo)) % modulo;
    }
  }
}
template <typename T>
T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <typename T>
T lcm(T p, T q) {
  return (p * q) / gcd<T>(p, q);
}
template <typename T>
T perfect_square(T a) {
  if (!a or a == 1) {
    return true;
  }
  T l = 2, r = a;
  while (l <= r) {
    T m = l + (r - l) / 2;
    if ((m * m) == a) {
      return true;
    } else if ((m * m) > a) {
      r = m - 1;
    } else {
      l = m + 1;
    }
  }
  return false;
}
bool valid(string s, int len) {
  deque<char> se;
  map<char, int> mp;
  mp['1'] = 0;
  mp['2'] = 0;
  mp['3'] = 0;
  for (int j = 0; j < len; ++j) {
    se.emplace_back(s[j]);
    mp[s[j]]++;
  }
  if (mp['1'] > 0 and mp['2'] > 0 and mp['3'] > 0) {
    return true;
  }
  int steps = s.length() - len;
  for (int i = 1; i <= steps; ++i) {
    se.emplace_back(s[len - 1 + i]);
    mp[s[len - 1 + i]]++;
    mp[se.front()]--;
    se.pop_front();
    if (mp['1'] > 0 and mp['2'] > 0 and mp['3'] > 0) {
      return true;
    }
  }
  return false;
}
long long mulmod(long long a, long long b, long long c) {
  if (b == 0) {
    return 0;
  }
  long long s = mulmod(a, b / 2, c);
  if (b % 2 == 1) {
    long long p = (a % c + 2 * (s % c)) % c;
    return p;
  } else {
    long long p = (2 * (s % c)) % c;
    return p;
  }
}
const long long X = 212072634227239451;
int main() {
  std::chrono::time_point<std::chrono::high_resolution_clock> start_timer,
      end_timer;
  start_timer = std::chrono::high_resolution_clock::now();
  bool show_time = false;
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long n;
  cin >> n;
  long long l = n % 10;
  if (l == 2 or l == 4 or l == 7 or l == 9 or l == 5) {
    cout << "hon\n";
  } else if (l == 0 or l == 1 or l == 6 or l == 8) {
    cout << "pon\n";
  } else {
    cout << "bon\n";
  }
  end_timer = std::chrono::high_resolution_clock::now();
  long long elapsed_time =
      std::chrono::duration_cast<std::chrono::milliseconds>(end_timer -
                                                            start_timer)
          .count();
  if (show_time) {
    cout << "\nElapsed Time: " << elapsed_time << "ms\n";
  }
  return 0;
}
