#include<bits/stdc++.h>
using namespace std;
const int MAXN=2e6+5;
int lst=1,tot=1,fa[MAXN],len[MAXN],ch[MAXN][26];
int ins(int c) {
	int x=++tot,p=lst;
	len[x]=len[p]+1;
	while(p&&!ch[p][c]) ch[p][c]=x,p=fa[p];
	if(!p) fa[x]=1;
	else {
		int q=ch[p][c];
		if(len[q]==len[p]+1) fa[x]=q;
		else {
			int r=++tot;
			len[r]=len[p]+1,fa[r]=fa[q],fa[x]=fa[q]=r;
			memcpy(ch[r],ch[q],sizeof(ch[r]));
			while(p&&ch[p][c]==q) ch[p][c]=r,p=fa[p];
		}
	}
	return lst=x;
}
vector <int> G[MAXN];
int n,L[MAXN],R[MAXN],up[MAXN][21],ed[MAXN],dcnt;
char s[MAXN];
void dfs(int u) {
	L[u]=++dcnt,up[u][0]=fa[u];
	for(int k=1;k<21;++k) up[u][k]=up[up[u][k-1]][k-1];
	for(int v:G[u]) dfs(v);
	R[u]=dcnt;
}
struct FenwickTree {
	int tr[MAXN],s;
	void add(int x) { for(;x<=dcnt;x+=x&-x) ++tr[x]; }
	int qry(int x) { for(s=0;x;x&=x-1) s+=tr[x]; return s; }
}	T;
int f[MAXN],stk[MAXN],tp;
int w(int l,int r) {
	int u=ed[r];
	for(int k=20;~k;--k) if(up[u][k]&&len[up[u][k]]>=r-l+1) u=up[u][k];
	return T.qry(R[u])-T.qry(L[u]-1);
}
void upd(int x,int y) { f[y]=max(f[y],w(x+1,y)-f[x]); }
signed main() {
	scanf("%s",s+1),n=strlen(s+1);
	reverse(s+1,s+n+1);
	for(int i=1;i<=n;++i) ed[i]=ins(s[i]-'a');
	for(int i=2;i<=tot;++i) G[fa[i]].push_back(i);
	dfs(1);
	for(int i=1;i<=n;++i) {
		T.add(L[ed[i]]),f[i]=1;
		for(;tp;--tp) {
			upd(stk[tp],i);
			if(f[stk[tp]]<f[i]) break;
		}
		stk[++tp]=i;
	}
	printf("%d\n",f[n]);
	return 0;
}