#include<cstring>

#include<iostream>

#include<algorithm>

#include<cstdio>

#define rep(i,l,r) for (int i=l;i<=r;i++)

#define down(i,l,r) for (int i=l;i>=r;i--)

#define clr(x,y) memset(x,y,sizeof(x))

#define ll long long

#define maxn 100500

using namespace std;

int len[maxn],cnt[maxn],p1[maxn],p2[maxn],fail[maxn],s[maxn],to[maxn][];

int n,ans,tot,last,L,len1,len2;

char ch1[maxn],ch2[maxn];

void init(){

    len[tot=]=; len[++tot]=-;

    fail[]=; s[n=]=-; last=;

    clr(to,);

}

void add(int c,int p[]){

    s[++n]=c;

    int tmp,cur,now;

    for (cur=last;s[n-len[cur]-]!=c;cur=fail[cur]);

    if (!to[cur][c]){

        len[++tot]=len[cur]+; now=tot;

        for (tmp=fail[cur];s[n-len[tmp]-]!=c;tmp=fail[tmp]);

        fail[now]=to[tmp][c];

        to[cur][c]=now;

    } last=to[cur][c];

    cnt[last]++;

    p[n]=n-len[last]+;

}

int main(){

    scanf("%s",ch1); L=strlen(ch1);

    rep(i,,L-) ch2[L--i]=ch1[i];

    init();

    rep(i,,L-) add(ch1[i]-'a',p1);

    init();

    rep(i,,L-) add(ch2[i]-'a',p2);

    rep(i,,L-){

        len1=i-p1[i]+;

        len2=L-i-p2[L-i]+;

        ans=max(ans,len1+len2);

    }

    printf("%d\n",ans);

    return ;

}