#include<bits/stdc++.h>
#define ll long long
#define ffor(i,a,b) for(int i=(a);i<=(b);i++)
#define roff(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int MAXN=1e6+10; 
string S;
int n,tot,lst,cnt[MAXN],fail[MAXN],to[MAXN][27],len[MAXN];
vector<int> G[MAXN];
void dfs(int u) {
	for(auto v:G[u]) dfs(v),cnt[u]+=cnt[v];	
	return ;
}
signed main() {
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	tot=1,len[1]=-1,fail[0]=1;
	cin>>S,n=S.size(),S="*"+S;
	lst=1;
	ffor(i,1,n) {
		while(S[i]!=S[i-1-len[lst]]) lst=fail[lst];
		if(to[lst][S[i]-'a']==0) {
			to[lst][S[i]-'a']=++tot,len[tot]=len[lst]+2,fail[tot]=fail[lst];
			while(to[fail[tot]][S[i]-'a']==0) fail[tot]=fail[fail[tot]];
			fail[tot]=to[fail[tot]][S[i]-'a'];
			if(fail[tot]==tot) fail[tot]=0;
		}
		lst=to[lst][S[i]-'a'],cnt[lst]++;
	}
	ffor(i,0,tot) if(i!=1) G[fail[i]].push_back(i);
	dfs(1);
	ll ans=0;
	ffor(i,0,tot) if(i!=1) ans=max(ans,1ll*len[i]*cnt[i]*len[i]);
	cout<<ans;
	return 0;
}