S = input()
n = len(S)
ans = 0
for i in range(n):
    for j in range(i+1, n + 1):
        if i == 0 and j == n:
            break
        T = S[i:j]
        if T == T[::-1]:
            ans = max(ans, j - i)
print(ans)