HDU 1058

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


using namespace std;


int a[5850];
int n;


int min1(int a1,int a2,int a3,int a4)
{
    if(a1<=a2&&a1<=a3&&a1<=a4)return a1;
    else if(a2<=a1&&a2<=a3&&a2<=a4)return a2;
    else if(a3<=a1&&a3<=a2&&a3<=a4)return a3;
    else
    {
        return a4;
    }
}


int main()
{
    int i,j;
    int p1,p2,p3,p4;
    p1=1,p2=1,p3=1,p4=1;
    int k=1;
    a[1]=1;


    while(a[k]<2000000000)
    {
        a[++k]=min1(2*a[p1],3*a[p2],5*a[p3],7*a[p4]);
        if(a[k]==2*a[p1])p1++;
        if(a[k]==3*a[p2])p2++;
        if(a[k]==5*a[p3])p3++;
        if(a[k]==7*a[p4])p4++;
    }


    while(scanf("%d",&n),n)
    {
        if(n%10==1&&n%100!=11)
        {
            printf("The %dst humble number is %d.\n",n,a[n]);
        }
        else if(n%10==2&&n%100!=12)
        {
            printf("The %dnd humble number is %d.\n",n,a[n]);
        }
        else if(n%10==3&&n%100!=13)
        {
            printf("The %drd humble number is %d.\n",n,a[n]);
        }
        else
        {
            printf("The %dth humble number is %d.\n",n,a[n]);
        }
    }
    return 0;
}