{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"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. \r\u003cbr\u003e\r\u003cbr\u003eWrite a program to find and print the nth element in this sequence.\r\u003cbr\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The input consists of one or more test cases. Each test case consists of one integer n with 1 \u0026lt;\u003d n \u0026lt;\u003d 5842. Input is terminated by a value of zero (0) for n."}},{"title":"Output","value":{"format":"HTML","content":"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."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e1\r\n2\r\n3\r\n4\r\n11\r\n12\r\n13\r\n21\r\n22\r\n23\r\n100\r\n1000\r\n5842\r\n0\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eThe 1st humble number is 1.\r\nThe 2nd humble number is 2.\r\nThe 3rd humble number is 3.\r\nThe 4th humble number is 4.\r\nThe 11th humble number is 12.\r\nThe 12th humble number is 14.\r\nThe 13th humble number is 15.\r\nThe 21st humble number is 28.\r\nThe 22nd humble number is 30.\r\nThe 23rd humble number is 32.\r\nThe 100th humble number is 450.\r\nThe 1000th humble number is 385875.\r\nThe 5842nd humble number is 2000000000.\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}