{"trustable":true,"prependHtml":"\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eEverybody knows that we use decimal notation, i.e. the base of our notation is 10. Historians say that it\nis so because men have ten fingers. Maybe they are right. However, this is often not very convenient, ten\nhas only four divisors -- 1, 2, 5 and 10. Thus, fractions like 1/3, 1/4 or 1/6 have inconvenient decimal\nrepresentation. In this sense the notation with base 12, 24, or even 60 would be much more convenient.\u003c/p\u003e\n\n\u003cp\u003eThe main reason for it is that the number of divisors of these numbers is much greater -- 6, 8 and 12\nrespectively. A good quiestion is: what is the number not exceeding n that has the greatest possible\nnumber of divisors? This is the question you have to answer.\u003c/p\u003e\n\n\n\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e\u003c/p\u003e\n\n\u003cp\u003eThe input consists of several test cases, each test case contains a integer n (1 \u0026lt;\u003d n \u0026lt;\u003d 10\u003csup\u003e16\u003c/sup\u003e).\u003c/p\u003e\n\n\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e\u003c/p\u003e\n\n\u003cp\u003eFor each test case, output positive integer number that does not exceed n and has the greatest possible number of divisors in a line. If there are several such numbers, output the smallest one.\u003c/p\u003e\n\n\u003cb\u003eSample Input:\u003c/b\u003e\u003cpre\u003e10\n20\n100\n\u003c/pre\u003e\n\n\u003cb\u003eSample Output:\u003c/b\u003e\u003cpre\u003e6\n12\n60\n\u003c/pre\u003e\n\n\n\n\n\u003cbr\u003e\n"}}]}