{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"Given an integer **n**, you have to find:\n\n\n$$lcm(1, 2, 3, \\dots, n)$$\n\n**lcm** means least common multiple. For example lcm(2, 5, 4) \u003d 20, lcm(3, 9) \u003d 9, lcm(6, 8, 12) \u003d 24."}},{"title":"Input","value":{"format":"MD","content":"Input starts with an integer **T (\u0026le; 10000)**, denoting the number of test cases.\n\nEach case starts with a line containing an integer **n (2 \u0026le; n \u0026le; 10\u003csup\u003e8\u003c/sup\u003e)**."}},{"title":"Output","value":{"format":"MD","content":"For each case, print the case number and **lcm(1, 2, 3, ..., n)**. As the result can be very big, print the result modulo **2\u003csup\u003e32\u003c/sup\u003e**."}},{"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\u003e5\n10\n5\n200\n15\n20\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: 2520\nCase 2: 60\nCase 3: 2300527488\nCase 4: 360360\nCase 5: 232792560\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}