/* -*- coding: utf-8 -*-
 *
 * 2204.cc:  No.2204 Palindrome Splitting (No Rearrangement ver.) - yukicoder
 */

#include<cstdio>
#include<cstring>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 5000;
const int INF = 1 << 30;

/* typedef */

/* global variables */

char s[MAX_N + 4];
bool ps[MAX_N + 1][MAX_N + 1];
int dp[MAX_N + 1];

/* subroutines */

/* main */

int main() {
  scanf("%s", s);
  int n = strlen(s);

  for (int i = 0; i <= n; i++) ps[i][i] = true;
  for (int i = 0; i < n; i++) ps[i][i + 1] = true;
  for (int l = 2; l <= n; l++)
    for (int i = 0, j = l; j <= n; i++, j++)
      ps[i][j] = (ps[i + 1][j - 1] && s[i] == s[j - 1]);

  dp[0] = INF;
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j <= n; j++)
      if (ps[i][j])
	dp[j] = max(dp[j], min(dp[i], j - i));
  
  printf("%d\n", dp[n]);
  return 0;
}