Description:

Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, ... shows the first 11 ugly numbers. By convention, 1 is included. Write a program to find and print the n’th ugly number.

Input:

Every integer number (≤1500)describing position of ugly number from 1.If integer number is 0,the process should end. Maybe there are 10000 integer numbers on input data.

Output:

Every integer given should output a line as shown below, The <n>th ugly number is <number>. With <n> replaced by the integer number and <number> replaced by the number computed.

Sample Input:

5 16

Sample Output:

The 5th ugly number is 5.
The 16th ugly number is 25.