// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

namespace templates {
// type
using ll  = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pli = pair<ll, int>;
using Pll = pair<ll, ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
// clang-format off
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
// clang-format on

// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)

// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on

// const value
const ll MOD1   = 1000000007;
const ll MOD9   = 998244353;
const double PI = acos(-1);

// other macro
#ifndef RIN__LOCAL
#define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)

// function
vector<char> stoc(string &S) {
    int n = S.size();
    vector<char> ret(n);
    for (int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}
string ctos(vector<char> &S) {
    int n      = S.size();
    string ret = "";
    for (int i = 0; i < n; i++) ret += S[i];
    return ret;
}

template <class T>
auto min(const T &a) {
    return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
    return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
    auto b = clamp(a, l, r);
    return (a != b ? a = b, 1 : 0);
}

template <typename T>
T sum(vector<T> &A) {
    T tot = 0;
    for (auto a : A) tot += a;
    return tot;
}

template <typename T>
vector<T> compression(vector<T> X) {
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    return X;
}

// input and output
namespace io {

// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << ' ';
    }
    return os;
}

// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
    is >> A.first >> A.second;
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
    os << A.first << ' ' << A.second;
    return os;
}

// vector<pair<S, T>>
template <typename S, typename T>
istream &operator>>(istream &is, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        is >> A[i];
    }
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// tuple
template <typename T, size_t N>
struct TuplePrint {
    static ostream &print(ostream &os, const T &t) {
        TuplePrint<T, N - 1>::print(os, t);
        os << ' ' << get<N - 1>(t);
        return os;
    }
};
template <typename T>
struct TuplePrint<T, 1> {
    static ostream &print(ostream &os, const T &t) {
        os << get<0>(t);
        return os;
    }
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
    TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
    return os;
}

// io functions
void FLUSH() {
    cout << flush;
}

void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(std::forward<Tail>(tail)...);
}

template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << sep;
    }
    cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
    cout << A << end;
}
template <typename T>
void prispa(T A) {
    priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
    if (f)
        print(A);
    else
        print(B);
    return f;
}

template <class... T>
void inp(T &...a) {
    (cin >> ... >> a);
}

} // namespace io
using namespace io;

// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<int>> edges(n, vector<int>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        u -= indexed;
        v -= indexed;
        edges[u].push_back(v);
        if (!direct) edges[v].push_back(u);
    }
    return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
    return read_edges(n, n - 1, false, indexed);
}

template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        T w;
        inp(w);
        u -= indexed;
        v -= indexed;
        edges[u].push_back({v, w});
        if (!direct) edges[v].push_back({u, w});
    }
    return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
    return read_wedges<T>(n, n - 1, false, indexed);
}

// yes / no
namespace yesno {

// yes
inline bool yes(bool f = true) {
    cout << (f ? "yes" : "no") << endl;
    return f;
}
inline bool Yes(bool f = true) {
    cout << (f ? "Yes" : "No") << endl;
    return f;
}
inline bool YES(bool f = true) {
    cout << (f ? "YES" : "NO") << endl;
    return f;
}

// no
inline bool no(bool f = true) {
    cout << (!f ? "yes" : "no") << endl;
    return f;
}
inline bool No(bool f = true) {
    cout << (!f ? "Yes" : "No") << endl;
    return f;
}
inline bool NO(bool f = true) {
    cout << (!f ? "YES" : "NO") << endl;
    return f;
}

// possible
inline bool possible(bool f = true) {
    cout << (f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Possible(bool f = true) {
    cout << (f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool POSSIBLE(bool f = true) {
    cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// impossible
inline bool impossible(bool f = true) {
    cout << (!f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Impossible(bool f = true) {
    cout << (!f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool IMPOSSIBLE(bool f = true) {
    cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// Alice Bob
inline bool Alice(bool f = true) {
    cout << (f ? "Alice" : "Bob") << endl;
    return f;
}
inline bool Bob(bool f = true) {
    cout << (f ? "Bob" : "Alice") << endl;
    return f;
}

// Takahashi Aoki
inline bool Takahashi(bool f = true) {
    cout << (f ? "Takahashi" : "Aoki") << endl;
    return f;
}
inline bool Aoki(bool f = true) {
    cout << (f ? "Aoki" : "Takahashi") << endl;
    return f;
}

} // namespace yesno
using namespace yesno;

} // namespace templates
using namespace templates;

/////// https://ei1333.github.io/library/string/palindromic-tree.hpp
/**
 * @brief Palindromic Tree(回文木)
 * @see https://math314.hateblo.jp/entry/2016/12/19/005919
 * @docs docs/palindromic-tree.md
 */
template <typename T = char>
struct PalindromicTree {
  public:
    struct Node {
        map<T, int> link; // 子のidx
        int suffix_link;  // 最長回文接尾辞のidx
        int length;       // 対応する回文の長さ
        vector<int> idx;  // 対応する回文を最長回文接尾辞とするidx
        int delta_link;   // 差分が異なる最長回文接尾辞のidx

        Node() = default;

        Node(int suf, int length) : suffix_link(suf), length(length), delta_link(-1) {}
    };

    vector<Node> ns;
    int ptr;
    vector<T> vs;

  private:
    int find_prev_palindrome(int cur) const {
        int pos = (int)vs.size() - 1;
        for (;;) {
            int rev = pos - 1 - ns[cur].length;
            if (rev >= 0 and vs[rev] == vs.back()) break;
            cur = ns[cur].suffix_link;
        }
        return cur;
    }

    bool output_dfs(int v, int id, vector<T> &ret) const {
        if (v == id) return true;
        for (auto &nxt : ns[v].link) {
            if (output_dfs(nxt.second, id, ret)) {
                ret.emplace_back(nxt.first);
                return true;
            }
        }
        return false;
    }

  public:
    PalindromicTree() : ptr(0) {
        ns.emplace_back(0, -1); // 長さ -1
        ns.emplace_back(0, 0);  // 長さ 0
    }

    PalindromicTree(const string &S) : PalindromicTree() {
        add(S);
    }

    int diff(int t) const {
        if (ns[t].suffix_link <= 0) return -1;
        return ns[t].length - ns[ns[t].suffix_link].length;
    }

    int add(const T &x) {
        int idx = (int)vs.size();
        vs.emplace_back(x);
        int cur  = find_prev_palindrome(ptr);
        auto res = ns[cur].link.insert(make_pair(x, (int)ns.size()));
        ptr      = res.first->second;
        if (res.second) {
            ns.emplace_back(-1, ns[cur].length + 2);
            if (ns.back().length == 1) {
                ns.back().suffix_link = 1;
            } else {
                ns.back().suffix_link = ns[find_prev_palindrome(ns[cur].suffix_link)].link[x];
            }
            if (diff(ptr) == diff(ns.back().suffix_link)) {
                ns.back().delta_link = ns[ns.back().suffix_link].delta_link;
            } else {
                ns.back().delta_link = ns.back().suffix_link;
            }
        }
        ns[ptr].idx.emplace_back(idx);
        return ptr;
    }

    // add(x) のあとに呼び出す
    // * init(node_idx, pos):   頂点 node_idx を S[pos,i] が回文のときの初期値にする
    // * apply(node_idx, pre_idx): 頂点 node_idx に 頂点 pre_idx の結果を加える
    // * update: S[i]を末尾とする回文の頂点番号の集合
    template <typename I, typename U>
    vector<int> update_dp(const I &init, const U &apply) {
        int i  = (int)vs.size() - 1;
        int id = ptr;
        vector<int> update;
        while (ns[id].length > 0) {
            init(id, i + 1 - ns[ns[id].delta_link].length - diff(id));
            if (ns[id].suffix_link != ns[id].delta_link) {
                apply(id, ns[id].suffix_link);
            }
            update.emplace_back(id);
            id = ns[id].delta_link;
        }
        return update;
    }

    void add(const string &s) {
        for (auto &x : s) add(x);
    }

    vector<int> build_frequency() const {
        vector<int> ret(ns.size());
        for (int i = (int)ns.size() - 1; i > 0; i--) {
            ret[i] += (int)ns[i].idx.size();
            ret[ns[i].suffix_link] += ret[i];
        }
        return ret;
    }

    vector<T> output(int idx) const {
        if (idx == 0) return {-1};
        if (idx == 1) return {0};
        vector<T> ret;
        output_dfs(0, idx, ret);
        output_dfs(1, idx, ret);
        int start = (int)ret.size() - 1;
        if (ns[idx].length & 1) --start;
        for (int i = start; i >= 0; i--) {
            ret.emplace_back(ret[i]);
        }
        return ret;
    }

    int size() const {
        return (int)ns.size();
    }

    Node &operator[](int idx) {
        return ns[idx];
    }
};

void solve() {
    STRING(S);
    PalindromicTree pt(S);
    auto le  = pt.size();
    auto res = pt.build_frequency();
    vec(ll, ans, le, 0);

    fori(i, le) {
        auto &p = pt[i];
        if (p.length <= 0) continue;
        ll x = ll(res[i]) * ll(p.length);
        ans[i] += x;
        ans[i] += ans[p.suffix_link];
    }
    print(max(ans));
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    // cout << fixed << setprecision(12);
    int t;
    t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}