{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"Enid is a mountaineer. One day, when she was hiking in a mountain at midnight, she encountered a disgruntled ghost. The ghost was a failed mathematician in his previous life. So out of his frustration, he attacks the mountaineers with a very difficult mathematical question and kills them if they fail to answer. Enid was also asked such a question where she has to find a natural number **N** so that **N!** contains exactly **M** consecutive zeroes at the end. Also, the number **N** should be as minimum as possible. Can Enid find such a number and save herself?"}},{"title":"Input","value":{"format":"MD","content":"Input starts with an integer **T (\u0026#8804; 10000)**, denoting the number of test cases.\n\nEach case contains an integer **M (1 \u0026#8804; M \u0026#8804; 10\u003csup\u003e8\u003c/sup\u003e)** in a line."}},{"title":"Output","value":{"format":"MD","content":"For each case, print the case number and **N**. If no solution is found then print `impossible`."}},{"title":"Sample","value":{"format":"MD","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\n1\n2\n5\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: 5\nCase 2: 10\nCase 3: impossible\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}