#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include <cstdio>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<list>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<utility>
#include<vector>
#include <boost/multiprecision/cpp_int.hpp>


namespace mp = boost::multiprecision;

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

// 最大公約数
ll GCD(ll a, ll b)
{
    if (a < 0)
        a = -a;
    if (b < 0)
        b = -b;
    if (b == 0)
        return a;
    else
        return GCD(b, a % b);
}

// 最小公倍数
ll LCM(ll a, ll b)
{
    ll g = GCD(a, b);
    return a / g * b;
}

int main()
{
    string i;
    cin >> i;
    switch (i[i.length - 1])
    {
    case '2':
    case '4':
    case '5':
    case '7':
    case '9':
        cout << "hon";
        break;
    case '0':
    case '1':
    case '6':
    case '8':
        cout << "pon";
        break;
    case '3':
        cout << "bon";
    default:
        break;
    }
    cout << endl;
    return 0;
}