#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll LINF = 1e18;
template <class T>
void get_unique(vector<T>& x) {
    x.erase(unique(x.begin(), x.end()), x.end());
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        is >> v[i];
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        os << v[i];
        if (i < sz(v) - 1) os << ' ';
    }
    return os;
}
int main() {
    string s;
    cin >> s;
    int n = sz(s);
    // ok[l][r] := s[l..=r] が回文かどうか
    vector ok(n, vector(n, false));
    rep(i, n) {
        for (int l = i, r = i; l >= 0 && r < n; l--, r++) {
            if (s[l] == s[r]) {
                ok[l][r] = true;
            } else {
                break;
            }
        }
        for (int l = i, r = i + 1; l >= 0 && r < n; l--, r++) {
            if (s[l] == s[r]) {
                ok[l][r] = true;
            } else {
                break;
            }
        }
    }

    // dp[i] := i文字みたときの X の max
    vector dp(n + 1, -INF);
    dp[0] = INF;
    rep(i, n) {
        for (int r = i; r < n; r++) {
            if (ok[i][r]) {
                chmax(dp[r + 1], min(dp[i], r - i + 1));
            }
        }
    }
    cout << dp[n] << '\n';
}