#include<bits/stdc++.h>

using namespace std;
long long hs[808][808];
long long mod = 1000000007;
long long xr = 27;
main() {
    string x;
    cin >> x;
    int n = x.size();
    for (int i = 1; i <= n; i ++) {
        long long xx = 1;
        for (int j = i; j <= n; j ++) {
            hs[i][j] = (hs[i][j-1] + xx * (x[j-1] - 'a' + 1)) % mod;
            xx = (xx * xr) %mod;
        }
    }
    long long ans = 0;
    unordered_map<long long, int> q;
    for (int i = 2; i <= n; i += 2) {
        unordered_map<long long, int> q;
        for (int j = i/2; j < i; j ++) {
            int lo = j - i/2;
            int hi = i - j;
            q.clear();
            for (int k = 1; k <= n - j + 1; k ++) {
                if (k > hi) {
                    q[hs[k - hi][k - 1]] ++;
                }
                //cout << j << " " << k << " " <<  hi << "   " << hs[k - hi][k - 1] << " " << hs[k][k + hi - 1] << endl;
                if (j == i / 2) {
                    ans += q[hs[k][k + hi - 1]];
                    continue;
                }
                int hs1 = hs[k][k + lo - 1];
                int hs2 = hs[k + lo][k + lo + hi - 1];
                int hs3 = hs[k + lo + hi][k + 2 * lo + hi - 1];
                if (hs1 == hs3) {
                    ans += q[hs2];
                }
            }
            q.clear();
            for (int k = n - j + 1; k >= 1; k --) {
                if (k + j + hi - 1 <= n) {
                    q[hs[k + j][k + j + hi - 1]] ++;
                }
                if (j == i / 2) {
                    continue;
                }
                int hs1 = hs[k][k + lo - 1];
                int hs2 = hs[k + lo][k + lo + hi - 1];
                int hs3 = hs[k + lo + hi][k + 2 * lo + hi - 1];
                if (hs1 == hs3) {
                    ans += q[hs2];
                }
            }
        }
    }
    cout << ans;
}