{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv\u003e\u003cp\u003eChinese people think of \u00278\u0027 as the lucky digit. Bob also likes digit \u00278\u0027. Moreover, Bob has his own lucky number \u003ci\u003eL\u003c/i\u003e. Now he wants to construct his luckiest number which is the minimum among all positive integers that are a multiple of \u003ci\u003eL\u003c/i\u003e and consist of only digit \u00278\u0027.\u003c/p\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv\u003e\u003cp\u003eThe input consists of multiple test cases. Each test case contains exactly one line containing \u003ci\u003eL\u003c/i\u003e(1 ≤ \u003ci\u003eL\u003c/i\u003e ≤ 2,000,000,000).\u003c/p\u003e\u003cp\u003eThe last test case is followed by a line containing a zero. \u003c/p\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv\u003e\u003cp\u003eFor each test case, print a line containing the test case number( beginning with 1) followed by a integer which is the length of Bob\u0027s luckiest number. If Bob can\u0027t construct his luckiest number, print a zero.\u003c/p\u003e\u003c/div\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\u003e8\r\n11\r\n16\r\n0\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: 1\r\nCase 2: 2\r\nCase 3: 0\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}