{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"Elgoker have been resting for a long time. But now he is back and he come up with a challenging problem to you.\n\nElgoker always wondered about the number of zeroes found at the end of a factorial.\n\nSo, he tasked you to find the minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation.\n\nAs you know `N! \u003d 1 * 2 * ... * N`. For example, 5! \u003d 120, 120 contains one zero on the trail."}},{"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 **Q (1 \u0026#8804; Q \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"}}]}