//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
class SAM
{
	#define MAXN 2000000+5
	#define MAXLG 20
	public:
		SAM():last(1),tot(1){}
		int trans[MAXN][26],fail[MAXN],len[MAXN],occ[MAXN],last,tot,rep[MAXN],rt[MAXN];
		int in[MAXN],out[MAXN],dfn;
		int anc[MAXLG][MAXN];
		int _n;
		vector<int> G[MAXN];
		int extend(int x,int pos=0)
		{
			int p=last;
			int np=++tot;
			len[np]=len[p]+1;
			while(p&&!trans[p][x])
			{
				trans[p][x]=np;
				p=fail[p];
			}
			if(!p)
				fail[np]=1;
			else
			{
				int q=trans[p][x];
				if(len[p]+1==len[q])
					fail[np]=q;
				else
				{
					int nq=++tot;
					memcpy(trans[nq],trans[q],sizeof(int)*26);
					len[nq]=len[p]+1;
					fail[nq]=fail[q];
					fail[q]=fail[np]=nq;
					while(p&&trans[p][x]==q)
					{
						trans[p][x]=nq;
						p=fail[p];
					}
				}
			}
			last=np;
			occ[last]++;
			rep[last]=pos;
			return last;
		}
		void dfs(int u)
		{
			in[u]=++dfn;
			for(auto v:G[u])
			{
				dfs(v);
				occ[u]+=occ[v];
				rep[u]=max(rep[u],rep[v]);
			}
			out[u]=dfn;
		}
		void init()
		{
			for(int i=1;i<=tot;i++)
				if(fail[i])
					G[fail[i]].pb(i);
			dfs(1);
			for(int i=1;i<=tot;i++)
				anc[0][i]=fail[i];
			for(int i=1;i<MAXLG;i++)
				for(int j=1;j<=tot;j++)
					anc[i][j]=anc[i-1][anc[i-1][j]];
		}
		int locate(int node,int length)
		{
			for(int i=MAXLG-1;i>=0;i--)
				if(len[anc[i][node]]>=length)
					node=anc[i][node];
			return node;
		}
		void clear()
		{
			for(int i=1;i<=tot;i++)
			{
				memset(trans[i],0,sizeof(trans[i]));
				rt[i]=fail[i]=len[i]=occ[i]=rep[i]=0;
				for(int j=0;j<MAXLG;j++)
					anc[j][i]=0;
				G[i].clear();
			}
			last=tot=1;
		}
	#undef MAXN
	#undef MAXLG
}sam;
ll dp[1001000];
int nd[1001000];
int bit[2002000];
void update(int p,int v)
{
	while(p<2002000)
	{
		bit[p]+=v;
		p+=(p&(-p));
	}
}
int query(int p)
{
	int ans=0;
	while(p)
	{
		ans+=bit[p];
		p-=(p&(-p));
	}
	return ans;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	string s;
	cin>>s;
	rev(s);
	int n=sz(s);
	for(int i=1;i<=n;i++)
		nd[i]=sam.extend(s[i-1]-'a',i);
	sam.init();
	vector<int> vec;
	vec.pb(0);
	for(int i=1;i<=n;i++)
	{
		update(sam.in[nd[i]],1);
		while(sz(vec))
		{
			int pos=vec.back();
			int node=sam.locate(nd[i],i-pos);
			int app=query(sam.out[node])-query(sam.in[node]-1);
			dp[i]=max(dp[i],app-dp[pos]);
			if(dp[i]>dp[pos]) break;
			vec.pop_back();
		}
		vec.pb(i);
	}
	cout<<dp[n]<<endl;
	return 0;
}