#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

int n;
int a[31 * 20 * 14 * 12 + 1], sa;
const int maxn = 2000000000;
const int p2 = pow(2, 30), p3 = pow(3, 19), p5 = pow(5, 13), p7 = pow(7, 11);

int main()
{
    cin >> n;
    long long now;
    for(register long long i = 1; i <= p2; i *= 2)
    {
        now = i;
        for(register long long j = 1; j <= p3; j *= 3)
        {
            if(now * j > maxn) break;
            now *= j;
            for(register long long k = 1; k <= p5; k *= 5)
            {
                if(now * k > maxn) break;
                now *= k;
                for(register long long l = 1; l <= p7; l *= 7)
                {
                    if(now * l > maxn) break;
                    a[++sa] = now * l;
                }
                now /= k;
            }
            now /= j;
        }
    }
    sort(a + 1, a + sa + 1);
    cout << "The " << n;
    if(n % 100 >= 11 && n % 100 <= 13) cout << "th";
    else if(n % 10 == 1) cout << "st";
    else if(n % 10 == 2) cout << "nd";
    else if(n % 10 == 3) cout << "rd";
    else cout << "th";
    cout << " humble number is " << a[n] << ‘.‘;
    return 0;
}