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

bool isPalindrome(const string &s, int l, int r) {
    for (int i = 0; i < r - l; i++) {
        if (s[l + i] != s[r - 1 - i]) {
            return false;
        }
    }
    return true;
}

bool isPalTwo(const string &s, int l, int r) {
    if (r - l <= 1) {
        return false;
    }
    // evil solution
    for (int i = 1; i < min(100, r - l); i++) {
        if (isPalindrome(s, l, l + i) && isPalindrome(s, l + i, r)) {
            return true;
        }
    }
    /*
    for (int i = 1; i < r - l; i++) {
        if (isPalindrome(s, l, l + i) && isPalindrome(s, l + i, r)) {
            return true;
        }
    }
    */
    return false;
}

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;
    string t = s;
    reverse(t.begin(), t.end());
    int n = s.size();

    vector<bool> bad(n);
    vector<int64_t> cnt(n + 2);
    vector<int> z = zAlgorithm(s);
    vector<int> zF = zAlgorithm(s + "$" + t);
    vector<int> zB = zAlgorithm(t + "$" + s);

    for (int i = 1; i < n; i++) {
        if (bad[i]) {
            continue;
        }
        if (zF[n * 2 + 1 - i] >= 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;
            }
        }
    }
    for (int i = 2; i <= n - 2; i++) {
        if (bad[i]) {
            continue;
        }
        // TODO: more faster
        if (isPalTwo(s, 0, i)) {
            for (int j = 1; i * j < n; j++) {
                if (z[i * (j - 1)] < i) {
                    break;
                }
                cnt[i * j + 1] += j;
                bad[i * j] = true;
            }
        }
    }

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

    int64_t ans = 0;
    for (int i = 1; i < n; i++) {
        if (zB[n * 2 + 1 - i] >= i) {
            ans += cnt[n - i];
        }
    }
    cout << ans << endl;
}