#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e6+5,M=N*20+5,K=1e7+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e13+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;

vector<int> S[N];
namespace SAM{
	int cnt=1,La=1,son[N][26],link[N],len[N];
	void extend(char c){
		len[++cnt]=len[La]+1;int p=La;La=cnt;
		while(p&&!son[p][c]) son[p][c]=La,p=link[p];
		if(!p){link[La]=1;return;}
		int q=son[p][c];
		if(len[q]==len[p]+1){link[La]=q;return;}
		len[++cnt]=len[p]+1;link[cnt]=link[q];link[q]=link[La]=cnt;Mc(son[cnt],son[q]);
		while(p&&son[p][c]==q) son[p][c]=cnt,p=link[p];
	}
	void build(){
		for(int i=2;i<=cnt;i++) S[link[i]].push_back(i);
	}
}

char s[N];
int n,pl[N];
int bg[N],en[N],bh,fa[N][22];
void make(int x,int La){
	fa[x][0]=La;bg[x]=++bh;
	for(int i=1;fa[x][i-1];i++) fa[x][i]=fa[fa[x][i-1]][i-1];
	for(int i:S[x]) make(i,x);
	en[x]=bh;
}
int st[N],sh;
namespace bit{
	int f[N];
	void add(int x){while(x<=bh) f[x]++,x+=x&-x;}
	int qry(int x){int ans=0;while(x) ans+=f[x],x-=x&-x;return ans;}
}
void add(int x){
	bit::add(bg[pl[x]]);
}
int qry(int x,int y){
	x=y-x+1;y=pl[y];
	for(int i=21;~i;i--) if(SAM::len[fa[y][i]]>=x) y=fa[y][i];
	return bit::qry(en[y])-bit::qry(bg[y]-1);
}
int f[N];
void Solve(){
	scanf("%s",s+1);n=strlen(s+1);
	reverse(s+1,s+n+1);
	for(int i=1;i<=n;i++) SAM::extend(s[i]-'a'),pl[i]=SAM::La;
	SAM::build();
	make(1,0);
	for(int i=1;i<=n;i++){
		f[i]=1;
		add(i);
		while(sh){
			f[i]=max(f[i],qry(st[sh]+1,i)-f[st[sh]]);
			if(f[i]<=f[st[sh]]) sh--;
			else break;
		}
		st[++sh]=i;
		gdb(f[i]);
	}
	printf("%d\n",f[n]);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}