hd 1058 dp

//5842

#include <iostream>
#include<cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <string>

using namespace std;
const int inf = (1<<31)-1 ;
const int MAXN = 6e3;
int dp[MAXN];
int a[4]={2,3,5,7};
int ct[4]={1,1,1,1};

int main()
{
    int n;
    int mmin;
    dp[1] = 1;
    for(int i=2;i<=5842;i++){
        mmin = inf;
        for(int j=0;j<4;j++){
            mmin = min(mmin,a[j]*dp[ct[j]]);
        }
        dp[i] = mmin;
        for(int j=0;j<4;j++){
            if(dp[i]==a[j]*dp[ct[j]])
                ct[j]++;
        }
    }

    while(scanf("%d",&n),n){
        cout<<"The "<<n;
        if(10<n&&n<20)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 "<<dp[n]<<"."<<endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}