#include <bits/stdc++.h>

std::vector<int> manachar(const std::string &s) {
    int n = s.size();
    std::vector<int> rad(n);
    int c = 0;
    for (int r = 0; r < n; ++r) {
        int l = c - (r - c);
        if (r + rad[l] < c + rad[c]) {
            rad[r] = rad[l];
        } else {
            int rr = c + rad[c];
            int rl = r - (rr - r);
            while (rl >= 0 && rr < n && s[rl] == s[rr])
                ++rr, --rl;
            rad[r] = rr - r;
            c = r;
        }
    }
    return rad;
}

std::string insert_dollar(const std::string &s){
    int n = s.size();
    std::string res(n*2 + 1, '$');
    for(int i = 0; i < n; ++i){
        res[i*2 + 1] = s[i];
    }
    return res;
}

// [l, r)
bool is_palindrome(int l, int r, const std::vector<int> &rad){
    l = l*2 + 1;
    r = (r-1)*2 + 1;
    int c = (l + r) / 2;
    return r < c + rad[c];
}

using namespace std;

int main(){
    string s;
    while(cin >> s){
        int n = s.size();
        auto rad = manachar(insert_dollar(s));
        int pp[5010] = {};
        for(int i = 1; i < n; ++i){
            for(int j = i + 1; j <= n; ++j){
                if(is_palindrome(0, i, rad) && is_palindrome(i, j, rad)){
                    ++pp[j];
                }
            }
        }
        long long ans = 0;
        for(int i = 2; i < n; ++i){
            for(int j = i + 1; j < n; ++j){
                ans += (long long)pp[i] * is_palindrome(j, n, rad);
            }
        }
        cout << ans << endl;
    }
}