#include <bits/stdc++.h>

#define ll long long
#define dub long double
const int MAXN = 2e6+7;
const int inf = 1e9+7;
const dub eps = 1e-14;

using namespace std;

int tr[MAXN][30], len[MAXN], fail[MAXN];
int lst = 1, cnt = 1;
string s;
queue <int> q;
int in[MAXN], f[MAXN];

inline int read( )<%
    int x = 0 ; short w = 0 ; char ch = 0;
    while( !isdigit(ch) ) { w|=ch=='-';ch=getchar();}
    while( isdigit(ch) ) {x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
    return w ? -x : x;
%>

int get(char x){ return x - 'a'; }

void insert(int x){
    int p = lst, np = ++cnt, q, nq; lst = np;
    len[np] = len[p] + 1; f[np] = 1;
    for(; p and !tr[p][x]; p = fail[p]) tr[p][x] = np;
    if(!p) fail[np] = 1;
    else if(len[q = tr[p][x]] == len[p] + 1) fail[np] = q;
    else{
        nq = ++cnt;
        fail[nq] = fail[q];
        len[nq] = len[p] + 1;
        fail[q] = fail[np] = nq;
        memcpy(tr[nq], tr[q], sizeof(tr[q]));
        for(;p and tr[p][x] == q; p = fail[p]) tr[p][x] = nq;
    }
}

void tpsort( ){
    for(int i = 1; i <= cnt; i++)
        in[fail[i]]++;
    for(int i = 1; i <= cnt; i++)
        if(!in[i]) q.push(i);
    while(!q.empty()){
        int x = q.front( ); q.pop( );
        f[fail[x]] += f[x];
        in[fail[x]]--;
        if(!in[fail[x]]) q.push(fail[x]);
    }
}

int main( )<%

    cin >> s;

    for(int i = 0; i < (int)s.size( ); i++)
        insert(get(s[i]));

    tpsort();

    ll ans = 0; 
    for(int i = 2; i <= cnt; i++)
        if(f[i] > 1) ans = max(ans, (ll)f[i] * len[i]);

    cout << ans;

    return 0;
%>