#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

// need to discretize
struct SuffixArray {
    int n;
    vector<int> sa, as, ha;
    vector<vector<int>> rmq;
template <typename T>
    vector<int> sais(const T &s) {
        int n = s.size(), m = *max_element(s.begin(), s.end()) + 1;
        vector<int> pos(m + 1), f(n);
        for (auto ch : s) { pos[ch + 1]++; }
        for (int i = 0; i < m; i++) { pos[i + 1] += pos[i]; }
        for (int i = n - 2; i >= 0; i--) { f[i] = s[i] != s[i + 1] ? s[i] < s[i + 1] : f[i + 1]; }
        vector<int> x(m), sa(n);
        auto induce = [&](const vector<int> &ls) {
            fill(sa.begin(), sa.end(), -1);
            auto L = [&](int i) { if (i >= 0 && !f[i]) { sa[x[s[i]]++] = i; }};
            auto S = [&](int i) { if (i >= 0 && f[i]) { sa[--x[s[i]]] = i; }};
            for (int i = 0; i < m; i++) { x[i] = pos[i + 1]; }
            for (int i = int(ls.size()) - 1; i >= 0; i--) { S(ls[i]); }
            for (int i = 0; i < m; i++) { x[i] = pos[i]; }
            L(n - 1);
            for (int i = 0; i < n; i++) { L(sa[i] - 1); }
            for (int i = 0; i < m; i++) { x[i] = pos[i + 1]; }
            for (int i = n - 1; i >= 0; i--) { S(sa[i] - 1); }
        };
        auto ok = [&](int i) { return i == n || !f[i - 1] && f[i]; };
        auto same = [&](int i, int j) {
            do { if (s[i++] != s[j++]) { return false; }} while (!ok(i) && !ok(j));
            return ok(i) && ok(j);
        };
        vector<int> val(n), lms;
        for (int i = 1; i < n; i++) { if (ok(i)) { lms.push_back(i); }}
        induce(lms);
        if (!lms.empty()) {
            int p = -1, w = 0;
            for (auto v : sa) {
                if (v != 0 && ok(v)) {
                    if (p != -1 && same(p, v)) { w--; }
                    val[p = v] = w++;
                }
            }
            auto b = lms;
            for (auto &v : b) { v = val[v]; }
            b = sais(b);
            for (auto &v : b) { v = lms[v]; }
            induce(b);
        }
        return sa;
    }
template <typename T>
    SuffixArray(const T &s) : n(s.size()), sa(sais(s)), as(n), ha(n - 1) {
        for (int i = 0; i < n; i++) { as[sa[i]] = i; }
        for (int i = 0, j = 0; i < n; ++i) {
            if (as[i] == 0) {
                j = 0;
            } else {
                for (j -= j > 0; i + j < n && sa[as[i] - 1] + j < n && s[i + j] == s[sa[as[i] - 1] + j]; ) { ++j; }
                ha[as[i] - 1] = j;
            }
        }
        if (n > 1) {
            int lg = __lg(n - 1);
            rmq.assign(lg + 1, vector<int>(n - 1));
            rmq[0] = ha;
            for (int i = 1; i <= lg; i++) {
                for (int j = 0; j + (1 << i) < n; j++) {
                    rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << i - 1)]);
                }
            }
        }
    }
    int lcp(int i, int j) {
        if (i == j) {
            return n - i;
        }
        i = as[i], j = as[j];
        if (i > j) {
            swap(i, j);
        }
        int k = __lg(j - i);
        return min(rmq[k][i], rmq[k][j - (1 << k)]);
    }
};

template <typename T>
struct Fenwick {
    int n;
    vector<T> a;
    Fenwick(int n = 0) : n(n), a(n) {}
    void add(int p, T v) {
        while (p < n) {
            a[p] += v;
            p |= p + 1;
        }
    }
    T sum(int p) {
        T res = {};
        while (p >= 0) {
            res += a[p];
            p = (p & p + 1) - 1;
        }
        return res;
    }
};

template <class Info>
struct SegmentTree {
    int n;
    vector<Info> info;
    SegmentTree(int n): n(n), info(4 * n) {}
template <typename T>
    SegmentTree(vector<T> init) : SegmentTree(init.size()) {
        auto go = [&](auto go, int id, int l, int r) -> void {
            if (r - l == 1) {
                info[id] = {init[l]};
                return;
            }
            int m = l + r >> 1;
            go(go, id << 1, l, m);
            go(go, id << 1 | 1, m, r);
            pull(id);
        };
        go(go, 1, 0, n);
    }
    void pull(int id) {
        info[id] = info[id << 1] + info[id << 1 | 1];
    }
    void modify(int p, const Info &v) {
        auto go = [&](auto go, int id, int l, int r) -> void {
            if (r - l == 1) {
                info[id] = v;
                return;
            }
            int m = l + r >> 1;
            p < m ? go(go, id << 1, l, m) : go(go, id << 1 | 1, m, r);
            pull(id);
        };
        go(go, 1, 0, n);
    }
    Info rangeQuery(int ql, int qr) {
        auto go = [&](auto go, int id, int l, int r) -> Info {
            if (qr <= l || r <= ql) {
                return Info();
            }
            if (ql <= l && r <= qr) {
                return info[id];
            }
            int m = l + r >> 1;
            return go(go, id << 1, l, m) + go(go, id << 1 | 1, m, r);
        };
        return go(go, 1, 0, n);
    }
template <typename F>
    int findFirst(int ql, int qr, F f) {
        auto go = [&](auto go, int id, int l, int r) -> int {
            if (qr <= l || r <= ql || !f(info[id])) {
                return -1;
            }
            if (r - l == 1) {
                return l;
            }
            int m = l + r >> 1;
            int res = go(go, id << 1, l, m);
            if (res == -1) {
                res = go(go, id << 1 | 1, m, r);
            }
            return res;
        };
        return go(go, 1, 0, n);
    }
template <typename F>
    int findLast(int ql, int qr, F f) {
        auto go = [&](auto go, int id, int l, int r) -> int {
            if (qr <= l || r <= ql || !f(info[id])) {
                return -1;
            }
            if (r - l == 1) {
                return l;
            }
            int m = l + r >> 1;
            int res = go(go, id << 1 | 1, m, r);
            if (res == -1) {
                res = go(go, id << 1, l, m);
            }
            return res;
        };
        return go(go, 1, 0, n);
    }
};

constexpr int inf = 1e9;
struct Min {
    int x = inf;
};
Min operator+(Min a, Min b) {
    return {min(a.x, b.x)};
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        string s;
        cin >> s;

        int n = s.size();
        SuffixArray sa(s);
        SegmentTree<Min> st(sa.ha);

        vector<i64> dp(n + 1), stk{n};
        Fenwick<int> f(n);

        for (int i = n - 1; i >= 0; i--) {
            int pos = sa.as[i];
            f.add(pos, 1);
            while (!stk.empty()) {
                int j = stk.back();
                int len = j - i;
                int l = st.findLast(0, pos, [&](const auto &info) { return info.x < len; }) + 1;
                int r = st.findFirst(pos, n - 1, [&](const auto &info) { return info.x < len; });
                if (r == -1) {
                    r = n - 1;
                }
                dp[i] = max(dp[i], f.sum(r) - f.sum(l - 1) - dp[j]);
                if (dp[i] <= dp[j]) {
                    stk.pop_back();
                } else {
                    break;
                }
            }
            stk.push_back(i);
        }

        cout << dp[0] << '\n';
    };
    
    solve();
    
    return 0;
}