#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#include <experimental/iterator>
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

auto sais(const auto &s) {
  const int n = (int)s.size(), z = ranges::max(s) + 1;
  vector<int> c(z); for (int x : s) ++c[x];
  partial_sum(all(c), begin(c));
  vector<int> sa(n); auto I = views::iota(0, n);
  if (ranges::max(c) <= 1) {
    for (int i : I) sa[--c[s[i]]] = i;
    return sa;
  }
  vector<bool> t(n); t[n - 1] = true;
  for (int i = n - 2; i >= 0; --i)
    t[i] = (s[i]==s[i + 1] ? t[i + 1] : s[i]<s[i + 1]);
  auto is_lms = views::filter([&t](int x) {
    return x && t[x] && !t[x - 1]; });
  auto induce = [&] {
    for (auto x = c; int y : sa)
      if (y--) if (!t[y]) sa[x[s[y] - 1]++] = y;
    for (auto x = c; int y : sa | views::reverse)
      if (y--) if (t[y]) sa[--x[s[y]]] = y;
  };
  vector<int> lms, q(n); lms.reserve(n);
  for (auto x = c; int i : I | is_lms) {
    q[i] = int(lms.size());
    lms.push_back(sa[--x[s[i]]] = i);
  }
  induce(); vector<int> ns(lms.size());
  for (int j = -1, nz = 0; int i : sa | is_lms) {
    if (j >= 0) {
      int len = min({n - i, n - j, lms[q[i] + 1] - i});
      ns[q[i]] = nz += lexicographical_compare(
          begin(s) + j, begin(s) + j + len,
          begin(s) + i, begin(s) + i + len);
    }
    j = i;
  }
  ranges::fill(sa, 0); auto nsa = sais(ns);
  for (auto x = c; int y : nsa | views::reverse)
    y = lms[y], sa[--x[s[y]]] = y;
  return induce(), sa;
}
// sa[i]: sa[i]-th suffix is the
// i-th lexicographically smallest suffix.
// hi[i]: LCP of suffix sa[i] and suffix sa[i - 1].
struct Suffix {
  int n; vector<int> sa, hi, rev;
  Suffix(const auto &s) : n(int(s.size())),
    hi(n), rev(n) {
    vector<int> _s(n + 1); // _s[n] = 0;
    copy(all(s), begin(_s)); // s shouldn't contain 0
    sa = sais(_s); sa.erase(sa.begin());
    for (int i = 0; i < n; ++i) rev[sa[i]] = i;
    for (int i = 0, h = 0; i < n; ++i) {
      if (!rev[i]) { h = 0; continue; }
      for (int j = sa[rev[i] - 1]; i + h < n && j + h < n
          && s[i + h] == s[j + h];) ++h;
      hi[rev[i]] = h ? h-- : 0;
    }
  }
};

struct Dsu {
  vector<int> pa, sz;
  Dsu(int n) : pa(n), sz(n, 1) {
    iota(all(pa), 0);
  }
  int anc(int x) {
    return x==pa[x] ? x : pa[x]=anc(pa[x]);
  }
  void join(int x, int y) {
    x = anc(x);
    y = anc(y);
    if (sz[x] < sz[y]) swap(x, y);
    sz[x] += sz[y];
    pa[y] = x;
  }
};

signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  string s;
  cin >> s;
  Suffix sfx(s);

  vector<vector<int>> qs(sfx.n);
  for (int i = 1; i < sfx.n; i++)
    qs[sfx.hi[i]].emplace_back(i);

  Dsu dsu(sfx.n);
  int sz = 0;
  int64_t ans = 0;
  for (int i = sfx.n - 1; i >= 0; i--) {
    for (int pos : qs[i]) {
      dsu.join(pos - 1, pos);
      sz = max(sz, dsu.sz[dsu.anc(pos)]);
    }
    ans = max(ans, int64_t(i) * sz);
  }
  cout << ans << '\n';
}