Longest Palindromic Substring

Problem Description

Given a string $s$ consisting of lowercase letters, find the length of the longest palindromic substring of $s$.

Input Format

One line with a string $s$.

Output Format

Output one integer, the answer.

Sample Input

abbabbab

Sample Output

7

Constraints

For all data: $1 \leq |s| \leq 10^5$, and $s$ consists only of lowercase letters.