#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#define me(f, x) memset(f, x, sizeof(f))
#define mc(f, g) memcpy(f, g, sizeof(g))
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int N = 2e5 + 9;

int ed = 1, tot = 1;

struct {
  int l, p, ch[26];

  int operator[] (int d) const { return ch[d]; }
  int& operator[] (int d) { return ch[d]; }
} t[N << 1];

vi g[N << 1];
int cnt[N << 1];

void ext (int c) {
  int u = ++tot;
  t[u].l = t[ed].l + 1;
  cnt[u] = 1;
  int p = ed;
  for (; p && !t[p][c]; p = t[p].p) {
    t[p][c] = u;
  }
  ed = u;
  if (!p) {
    t[u].p = 1;
    return;
  }
  int q = t[p][c];
  if (t[q].l == t[p].l + 1) {
    t[u].p = q;
  } else {
    int cl = ++tot;
    t[cl] = t[q];
    t[cl].l = t[p].l + 1;
    t[q].p = t[u].p = cl;
    for (; p && t[p][c] == q; p = t[p].p) {
      t[p][c] = cl;
    }
  }
}

char s[N];

LL ans;

void dfs (int u) {
  for (int v : g[u]) {
    dfs(v);
    cnt[u] += cnt[v];
  }
  if (cnt[u] > 1) {
    ans = max(ans, (LL)cnt[u] * t[u].l);
  }
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> s;
  for (int i = 0; s[i]; ++i) {
    ext(s[i] - 'a');
  }
  L (i, 2, tot) {
    g[t[i].p].eb(i);
  }
  dfs(1);
  cout << ans << '\n';
}
// I love WHQ!