//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize("Ofast,fast-math")
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef double db;
#define F(i, a, b) for(int i = a; i <= (b); ++i)
#define F2(i, a, b) for(int i = a; i < (b); ++i)
#define dF(i, a, b) for(int i = a; i >= (b); --i)
template<typename T> void debug(string s, T x) {
	cerr << "[" << s << "] = [" << x << "]\n";
}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {
	for (int i = 0, b = 0; i < (int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++;
	else if (s[i] == ')' || s[i] == '}') b--;
	else if (s[i] == ',' && b == 0) {
		cerr << "[" << s.substr(0, i) << "] = [" << x << "] | ";
		debug(s.substr(s.find_first_not_of(' ', i + 1)), args...);
		break;
	}
}
#ifdef ONLINE_JUDGE
#define Debug(...)
#else
#define Debug(...) debug(#__VA_ARGS__, __VA_ARGS__)
#endif
#define pb push_back
#define fi first
#define se second
#define Mry fprintf(stderr, "%.3lf MB\n", (&Med - &Mbe) / 1048576.0)
#define Try cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
typedef long long ll;
// namespace Fread {const int SIZE = 1 << 17; char buf[SIZE], *S, *T; inline char getchar() {if (S == T) {T = (S = buf) + fread(buf, 1, SIZE, stdin); if (S == T) return '\n';} return *S++;}}
// namespace Fwrite {const int SIZE = 1 << 17; char buf[SIZE], *S = buf, *T = buf + SIZE; inline void flush() {fwrite(buf, 1, S - buf, stdout), S = buf;} inline void putchar(char c) {*S++ = c;if (S == T) flush();} struct NTR {~NTR() {flush();}} ztr;}
// #ifdef ONLINE_JUDGE
// #define getchar Fread::getchar
// #define putchar Fwrite::putchar
// #endif
inline int ri() {
	int x = 0;
	bool t = 0;
	char c = getchar();
	while (c < '0' || c > '9') t |= c == '-', c = getchar();
	while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	return t ? -x : x;
}
inline void wi(int x) {
	if (x < 0) {
		putchar('-'), x = -x;
	}
	if (x > 9) wi(x / 10);
	putchar(x % 10 + 48);
}
inline void wi(int x, char s) {
	wi(x), putchar(s);
}
bool Mbe;
// mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll infll = 0x3f3f3f3f3f3f3f3f;
const int _ = 2e5 + 5;

struct SAM {
	struct node {
		int len, fa, nxt[26];
	} tr[_ << 1];
	int cnt = 0, lst = 0, sz[_ << 1];
	void ins(int c) {
		int cur = ++cnt;
		tr[cur].len = tr[lst].len + 1;
		sz[cur] = 1;
		int p = lst;
		lst = cur;
		while(~p && !tr[p].nxt[c]) tr[p].nxt[c] = cur, p =tr[p].fa;
		if(p == -1) tr[cur].fa = 0;
		else {
			int q = tr[p].nxt[c];
			if(tr[q].len == tr[p].len + 1) {
				tr[cur].fa = q;
			} else {
				int nq = ++cnt;
				tr[nq] = tr[q];
				tr[nq].len = tr[p].len + 1;
				while(~p && tr[p].nxt[c] == q) tr[p].nxt[c] = nq, p = tr[p].fa;
				tr[cur].fa = tr[q].fa = nq;
			}
		}
	}
	ll ans = 0;
	void dfs(int u) {
//		if(sz[u] == 1) {
//			assert(d[u].empty());
//		}
		for(int v : d[u]) {
			dfs(v);
			sz[u] += sz[v];
		}
		if(u && sz[u] > 1) ans = max(ans, 1ll * sz[u] * tr[u].len);
	}
	SAM() {
		tr[0].fa = -1;
	}
	vi d[_ << 1];
	
	void init() {
		F(i, 1, cnt) d[tr[i].fa].pb(i);
		dfs(0);
		cout << ans << '\n';
	}
} tr;


bool Med;
signed main() {
	// Mry;
	string s;
	cin >> s;
	int len = s.size();
	F(i, 0, len - 1) tr.ins(s[i] - 'a');
	tr.init();
	// Try;
	return 0;
}