#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>
#include <atcoder/all>
#include <bits/stdc++.h>

#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace atcoder;
using namespace std;
typedef long long int ll;
typedef modint998244353 mint;




ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;

    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

/*
解説動画参考
解説ブログ参考

*/



int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   
    
    
    while (Q--) {
        string p;
        cin >> p;
        int n = p.size();
        
        int ans = 1;
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                if (!i && j >= n - 1)break;
                int a = j - i + 1;
                string x, y;
                x = p.substr(i, a/2);
                y = p.substr(i + (a+1) / 2 , a / 2);
                //cout << x << " " << y << endl;
                reverse(y.begin(), y.end());
                if (x == y)ans = max(ans, a);
            }
        }
        cout << ans;
    }

    return 0;
}