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

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

    const int mod = 1e9 + 7;
    srand(time(NULL));
    int64_t base = rand() + 2;

    vector<int64_t> pw(5050);
    pw[0] = 1;
    for (int i = 1; i < 5050; i++) {
        pw[i] = base * pw[i - 1] % mod;
    }

    vector<int64_t> P(n + 2);
    for (int i = 0; i < n; i++) {
        P[i + 1] = 1;
        for (int j = 0; j <= i; j++) {
            if (s[j] != s[i - j]) {
                P[i + 1] = 0;
            }
        }
    }

    vector<int64_t> PP(n + 2);
    for (int i = n - 1; i >= 0; i--) {
        int64_t a = 0;
        int64_t b = 0;
        for (int j = 0; i + j < n; j++) {
            a = a * base + s[i + j];
            b = b + s[i + j] * pw[j];
            a %= mod;
            b %= mod;
            if (a == b) {
                PP[i + j + 2] += P[i];
            }
        }
    }

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

    int64_t ans = 0;
    for (int i = n - 1; i >= 0; i--) {
        bool pal = true;
        for (int j = 0; j <= n - 1 - i; j++) {
            if (s[i + j] != s[n - 1 - j]) {
                pal = false;
            }
        }
        if (pal) {
            ans += PP[i];
        }
    }

    cout << ans << endl;
}