题目描述

Given a string, you are supposed to output the length of the longest
symmetric sub-string. For example, given "Is PAT&TAP
symmetric?", the longest symmetric sub-string is "s
PAT&TAP s", hence you must output 11.

输入描述:

Each input file contains one test case which gives a non-empty string of length no more than 1000.

输出描述:

For each test case, simply print the maximum length in a line.

输入例子:

Is PAT&TAP symmetric?

输出例子:

11