Given a string S, find the longest palindromic substring in the string S.

Input:
First and only line will contain string S.

Output:
Print the length of the longest palindrome substring in the first line. In the second line print the longest palindromic substring in S. If there is more than one palindromic substring with the maximum length, output the first one.

Constraints:
$1 \le N \le 10 ^ 5$
String S will only contain lower case English alphabet $[a-z]$.