{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"Given an integer **N**, you have to prime factorize **N!** (factorial **N**)."}},{"title":"Input","value":{"format":"MD","content":"Input starts with an integer **T (\u0026le; 125)**, denoting the number of test cases.\n\nEach case contains an integer **N (2 \u0026le; N \u0026le; 100)**."}},{"title":"Output","value":{"format":"MD","content":"For each case, print the case number and the factorization of the factorial in the following format as given in samples.\n\n\u003ccode\u003eCase x: N \u003d p\u003csub\u003e1\u003c/sub\u003e (power of p\u003csub\u003e1\u003c/sub\u003e) * p\u003csub\u003e2\u003c/sub\u003e (power of p\u003csub\u003e2\u003c/sub\u003e) * ...\u003c/code\u003e\n\nHere \u003cstrong\u003ex\u003c/strong\u003e is the case number, \u003cstrong\u003ep\u003csub\u003e1\u003c/sub\u003e, p\u003csub\u003e2\u003c/sub\u003e ...\u003c/strong\u003e are primes in ascending order."}},{"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\u003e3\n2\n3\n6\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: 2 \u003d 2 (1)\nCase 2: 3 \u003d 2 (1) * 3 (1)\nCase 3: 6 \u003d 2 (4) * 3 (2) * 5 (1)\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"MD","content":"The output for the 3\u003csup\u003erd\u003c/sup\u003e case is (if we replace spaces with `.`s) `Case.3:.6.\u003d.2.(4).*.3.(2).*.5.(1)`"}}]}