Longest Palindromic Substring Length

Given a string \(S\) consisting only of lowercase English letters (\(a, b, c, \ldots, z\)), find the length of its longest palindromic substring. Let \(n\) represent the length of \(S\).

inputFormat

The input consists of a single line containing the string \(S\).

outputFormat

Output a single integer representing the length of the longest palindromic substring in \(S\).

sample

abac

3