Description

Andy the smart computer science student was attending an algorithms class when the professor asked t he students a simple question, "Can you propose an efficient algorithm to find the length of the lar gest palindrome in a string?"A string is said to be a palindrome if it reads the same both forwards and backwards, for example "madam" is a palindrome while "acm" is not.The students recognized that t his is a classical problem but couldn't come up with a solution better than iterating over all subst rings and checking whether they are palindrome or not, obviously this algorithm is not efficient at all, after a while Andy raised his hand and said "Okay, I've a better algorithm" and before he start s to explain his idea he stopped for a moment and then said "Well, I've an even better algorithm!".I f you think you know Andy's final solution then prove it! Given a string of at most 1000000 characte rs find and print the length of the largest palindrome inside this string.InputYour program will be tested on at most 30 test cases, each test case is given as a string of at most 1000000 lowercase ch aracters on a line by itself. The input is terminated by a line that starts with the string "END" (q uotes for clarity).OutputFor each test case in the input print the test case number and the length of the largest palindrome.

给出一个长度为N(1 <= N <= 1000000)的字符串，求最长回文子串的长度。

Format

Input

多数据，以"END"代表结束

Output

如题

Samples

abcbabcbabcba
abacacbaaaab
END

Case 1: 13
Case 2: 6