{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv\u003e\u003cp\u003eThe repetition number of a string is defined as the maximum number \u003ci\u003eR\u003c/i\u003e such that the string can be partitioned into \u003ci\u003eR\u003c/i\u003e same consecutive substrings. For example, the repetition number of \"ababab\" is 3 and \"ababa\" is 1.\u003c/p\u003e\u003cp\u003eGiven a string containing lowercase letters, you are to find a substring of it with maximum repetition number.\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, which\u003cbr\u003egives a non-empty string consisting of lowercase letters. The length of the string will not be greater than 100,000.\u003c/p\u003e\u003cp\u003eThe last test case is followed by a line containing a \u0027#\u0027.\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 the substring of maximum repetition number. If there are multiple substrings of maximum repetition number, print the lexicographically smallest one.\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\u003eccabababc\r\ndaabbccaa\r\n#\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: ababab\r\nCase 2: aa\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}