#include <iostream>
#include <fstream>
#include <cstring>

using namespace std;

ifstream f("palm.in");
ofstream g("palm.out");

int N;
char sir[509];

int main()
{   int i, st, dr;
    int ans;

    f>>(sir + 1);
    N = strlen(sir + 1);

    ans = 1;
    for(i = 2; i < N; i++)
    {
        st = i - 1; dr = i + 1;
        while(sir[st] == sir[dr] && sir[st] <= sir[st + 1] && st >= 1 && dr <= N)
            st--, dr++;
        ans = max(ans, dr - st - 1);
    }
    g<<ans;

    f.close();
    g.close();
    return 0;
}