Problem Description

A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first 20 humble numbers.

Write a program to find and print the nth element in this sequence

 

Input

The input consists of one or more test cases. Each test case consists of one integer n with 1 <= n <= 5842. Input is terminated by a value of zero (0) for n.

 

Output

For each test case, print one line saying "The nth humble number is number.". Depending on the value of n, the correct suffix "st", "nd", "rd", or "th" for the ordinal number nth has to be used like it is shown in the sample output.

 

Sample Input

 

Sample Output

 

 #include<bits/stdc++.h>

 using namespace std;

 long long a[];

 int main() {

     int num=;

     int p2,p3,p5,p7;

     p2=p3=p5=p7=;

     a[]=;

     while(num<) {

         a[++num]=min(min(a[p2]*,a[p3]*),min(a[p5]*,a[p7]*));

         if(a[num]==*a[p2])//找到之后就在下面用if语句把能得到当前

         p2++;             // 丑数的情况去掉  继续找下一个

         if(a[num]==*a[p3])

         p3++;

         if(a[num]==*a[p5])

         p5++;

         if(a[num]==*a[p7])

         p7++;

     }

     int n;

     while(~scanf("%d",&n),n)

     {

             if(n%==&&n%!=)

                 printf("The %dst humble number is %lld.\n",n,a[n]);

             else if(n%==&&n%!=)

                 printf("The %dnd humble number is %lld.\n",n,a[n]);

             else if(n%==&&n%!=)

                 printf("The %drd humble number is %lld.\n",n,a[n]);

             else

                 printf("The %dth humble number is %lld.\n",n,a[n]);

     }

     return ;

 }