#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pi=pair<int,int>;
#define fi first
#define se second
const int N=1e6+5;
int n,sz,las,sn,fa[N*2],ch[N*2][26],len[N*2],L[N*2],R[N*2],bz[21][N*2],to[N],rt[N],st[N],f[N];
bool ok[N*2];
string a;
vector<int>e[N*2];
void ins(int id,int c) {
    int pos=++sz,p=las,q;len[pos]=len[las]+1,to[id]=pos;
    while(~p&&!ch[p][c])ch[p][c]=pos,p=fa[p];
    if(~p) {
        q=ch[p][c];
        if(len[q]==len[p]+1)fa[pos]=q;
        else {
            int cl=++sz;memcpy(ch[cl],ch[q],sizeof(ch[q]));
            len[cl]=len[p]+1,fa[cl]=fa[q],fa[q]=fa[pos]=cl;
            while(~p&&ch[p][c]==q)ch[p][c]=cl,p=fa[p];
        }
    }las=pos;
}
struct BIT{
    int c[N];
    void add(int x){for(;x<=n;x+=x&-x)c[x]++;}
    int ask(int x){int s=0;for(;x;x-=x&-x)s+=c[x];return s;}
}T;
void dfs(int x) {
    L[x]=sn+1,sn+=ok[x],bz[0][x]=max(fa[x],0);
    for(int i=1;i<=20;i++)bz[i][x]=bz[i-1][bz[i-1][x]];
    for(int y:e[x])dfs(y);R[x]=sn;
}
int calc(int p,int k) {
    int x=to[p];
    for(int i=20;~i;i--)if(len[bz[i][x]]>=k)x=bz[i][x];
    return T.ask(R[x])-T.ask(L[x]-1);
}
int main() {
    #ifndef ONLINE_JUDGE
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
    #endif
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>a,n=a.size(),reverse(a.begin(),a.end()),a=' '+a,fa[0]=-1;
    for(int i=1;i<=n;i++)ins(i,a[i]-'a'),ok[to[i]]=1;
    for(int i=1;i<=sz;i++)e[fa[i]].push_back(i);dfs(0);
    int top=1;
    for(int i=1;i<=n;i++) {
        T.add(L[to[i]]);
        for(;;top--) {
            f[i]=max(f[i],calc(i,i-st[top])-f[st[top]]);
            if(f[i]>=f[st[top]])break;
        }st[++top]=i;
    }
    cout<<f[n]<<'\n';
    return 0;
}