#include <cassert>

#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
//#include <boost/foreach.hpp>
//#include <boost/range/algorithm.hpp>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
#define INF 1000000000
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define MOD 1000000007LL
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};

struct P{
    int x,y;
};

bool kaibun(string s){
    if(s=="")return false;
    rep(i,0,s.size()/2){
        if(s[i]!=s[s.size()-i-1])return false;
    }
    return true;
}

int main (){
    string s; cin>>s;
    int ans=0;
    rep(i,1,s.size()){
        rep(j,i,s.size()){
            string s1=s.substr(i,j-i);
            string s2=s.substr(j);
            //cout<<s1<<" "<<s2<<endl;
            if(kaibun(s1))ans=max(ans,int(s1.size()));
            if(kaibun(s2))ans=max(ans,int(s2.size()));
        }
    }
    cout<<ans<<endl;
}



/*
1:1
2:n+(n-1)=2n-1
3:(n-1)+n+(n+1)=3n
4:(n-2)+(n-1)+n+(n+1)=4n-2=2(2n-1)
5: 4n-2+n+2=5n
6: 5n+n+3=6n+3=3(2n+1)

even:x/2
odd:x
corner 1
*/