// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Your shadow Gets in the way of my light
chr C[2000005];
uint M[2000005],Son[27][2000005],Fath[21][2000005],Dep[2000005],R[2000005],Cnt[2000005],tp;
uint find(uint f,chr c)
{
    if(Son[c=='$'?26:c-'a'][f])return Son[c=='$'?26:c-'a'][f];
    uint t=Son[c=='$'?26:c-'a'][f]=tp++;
    Fath[0][t]=f;for(uint i=1;i<=20;i++)Fath[i][t]=Fath[i-1][Fath[i-1][t]];
    Dep[t]=Dep[f]+(c!='$'?f?2:1:0),R[t]=R[f]+1;return t;
}
uint kth(uint p,uint k)
{
    for(uint i=0;~p&&i<=20;i++)if(k>>i&1)p=Fath[i][p];
    return p;
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    uint n=0;chr c;while((c=getchar())&&~c&&c!='\r'&&c!='\n')C[n++]=c,C[n++]='$';
    n--,R[0]=-1,tp=1;
    for(uint i=0,j=-1;i<n;i++)
    {
        if(~j&&i<=j+R[M[j]])
        {
            if(R[M[2*j-i]]<=j-i+R[M[j]])M[i]=M[2*j-i];
            else M[i]=kth(M[2*j-i],R[M[2*j-i]]-(j-i+R[M[j]]));
        }
        else M[i]=find(0,C[i]);
        while(R[M[i]]<i&&R[M[i]]+i+1<n&&C[i-R[M[i]]-1]==C[R[M[i]]+i+1])M[i]=find(M[i],C[R[M[i]]+i+1]);
        Cnt[M[i]]++;
        if(!~j||i+R[M[i]]>j+R[M[j]])j=i;
    }
    ullt ans=0;
    for(uint i=tp-1;i;i--)
        _max(ans,(ullt)Dep[i]*Dep[i]*Cnt[i]),Cnt[Fath[0][i]]+=Cnt[i];
    printf("%llu\n",ans);
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。