palindromes-3

Everybody loves palindromes, but Artur doesn't. He has a string  S  that consists of lowercase English letters ('a' - 'z'). Artur wants to find a substring  T   of  S of the maximal length, so that  T  isn't  a palindrome.
 Input
The input contains a single line, containing string  S. String  S  consists of lower case English letters.
Output
In a single line print the length of  T 

 Constraints

1 ≤ |S|  ≤ 100000

SAMPLE INPUT
aba

SAMPLE OUTPUT
2

Explanation

"aba" is a palindrome, but "ab" isn't.

Source: hackerearth | Difficulty: EASY
Tags: String algorithms

Fundamentals

Implementation


Solutions: