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

class Manacher {
private:
    const string &s;
    vector<int> rad;
    vector<int> suf;

public:
    Manacher(const string &s) : s(s), rad(s.size() * 2 - 1), suf(s.size()) {
        const int n = rad.size();
        int i = 0;
        int j = 0;
        while (i < n) {
            while (i - j >= 0 && i + j < n && get(i - j) == get(i + j)) {
                j++;
            }
            rad[i] = j;
            int k = 1;
            while (i - k >= 0 && i + k < n && k + rad[i - k] < j) {
                rad[i + k] = rad[i - k];
                k++;
            }
            i += k;
            j -= k;
        }
        vector<int> cen(n, n * 3);
        for (int i = 1; i < n; i++) {
            int r = min(i - 1, rad[i]);
            cen[i + r - 1] = min(cen[i + r - 1], i);
        }
        for (int i = n - 2; i >= 0; i--) {
            cen[i] = min(cen[i], cen[i + 1]);
        }
        for (int i = 0; i < n; i++) {
            cen[i] = (i - cen[i]) * 2 + 1;
        }
        for (int i = 0; i < s.size(); i++) {
            suf[i] = (cen[i * 2] + 1) / 2;
        }
    }

    // [l,r)
    bool isPalindrome(int l, int r) {
        return rad[l + r - 1] >= r - l;
    }

    // [0,k), ignore s[0, k)
    int longestPalindromicSuffix(int k) {
        return suf[k - 1];
    }

private:
    char get(int k) {
        return k % 2 == 0 ? s[k / 2] : '+';
    }
};

vector<int> zAlgorithm(string s) {
    vector<int> z(s.size());
    z[0] = s.size();
    int i = 1;
    int j = 0;
    while (i < s.size()) {
        while (i + j < s.size() && s[i + j] == s[j]) {
            j++;
        }
        z[i++] = j;
        if (j == 0) {
            continue;
        }
        j--;
        int k = 1;
        while (i < s.size() && z[k] < j) {
            z[i++] = z[k++];
            j--;
        }
    }
    return z;
}

int main() {
    string s;
    cin >> s;
    int n = s.size();

    Manacher mana(s);
    vector<bool> bad(n);
    vector<int64_t> cnt(n + 2);
    vector<int> z = zAlgorithm(s);

    for (int i = 1; i < n; i++) {
        if (bad[i]) {
            continue;
        }
        if (mana.isPalindrome(0, i)) {
            for (int j = 2; i * j < n; j++) {
                if (z[i * (j - 1)] < i) {
                    break;
                }
                cnt[i * j + 1] += j - 1;
                bad[i * j] = true;
            }
        }
    }
    int pre = 1;
    for (int i = 2; i <= n - 2; i++) {
        if (!bad[i]) {
            int suf = mana.longestPalindromicSuffix(i);
            bool ok = false;
            if (mana.isPalindrome(0, pre) && mana.isPalindrome(pre, i)) {
                ok = true;
            }
            if (mana.isPalindrome(0, i - suf) && mana.isPalindrome(i - suf, i)) {
                ok = true;
            }
            if (ok) {
                for (int j = 1; i * j < n; j++) {
                    if (z[i * (j - 1)] < i) {
                        break;
                    }
                    cnt[i * j + 1] += j;
                    bad[i * j] = true;
                }
            }
        }
        if (mana.isPalindrome(0, i)) {
            pre = i;
        }
    }

    for (int i = 0; i < n - 1; i++) {
        cnt[i + 1] += cnt[i];
    }

    int64_t ans = 0;
    for (int i = 0; i < n; i++) {
        if (mana.isPalindrome(i, n)) {
            ans += cnt[i];
        }
    }
    cout << ans << endl;
}