#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

char s[810];
int nxt[1010][1010];
ll ksj[1010][1010];

const int mod1 = 1e9+7, mod2=1e9+9;
unordered_map<ll, int> mp;

void cc(unordered_map<ll, int> a) {
    unordered_map<ll, int> b;
    swap(a, b);
}

int main() {
    scanf("%s", s+1);
    int n = strlen(s+1);
    rep (k, 1, n) {
        nxt[k][k] = k-1;
        rep (i, k+1, n) {
            int j = nxt[k][i-1];
            while (j >= k && s[j+1] != s[i]) j = nxt[k][j];
            if (s[j+1] == s[i]) j++;
            nxt[k][i] = j;
        }
    }
    for (int i = n; i >= 1; i--) {
        ll hs1 = 0, hs2 = 0;
        rep (j, i, n) {
            hs1 = (hs1 * 131 + s[j] - 'a' + 1) % mod1;
            hs2 = (hs2 * 19260817 + s[j] - 'a' + 1) % mod2;
            ksj[i][j] = hs1 * 2000000000 + hs2;
        }
    }
    ll ans = 0;
    for (int i = n; i >= 1; i--) {
        rep (j, i, n) {
           mp[ksj[i][j]]++;
        //    cout << ksj[i][j] <<' '<<mp[ksj[i][j]]<<endl;
        }
        int r = i-1;
        rep (l, 1, r) {
            ans += mp[ksj[l][r]];
            int t = nxt[l][r];
            while (t >= l) {
                int len = t - l + 1;
                if (len * 2 < r-l+1) {
                    ans += mp[ksj[l+len][r-len]];
                }
                t = nxt[l][t];
            }
        }
    }
    reverse(s+1, s+n+1);
    mp.clear();
    cc(mp);

    rep (k, 1, n) {
        nxt[k][k] = k-1;
        rep (i, k+1, n) {
            int j = nxt[k][i-1];
            while (j >= k && s[j+1] != s[i]) j = nxt[k][j];
            if (s[j+1] == s[i]) j++;
            nxt[k][i] = j;
        }
    }
    for (int i = n; i >= 1; i--) {
        ll hs1 = 0, hs2 = 0;
        rep (j, i, n) {
            hs1 = (hs1 * 131 + s[j] - 'a' + 1) % mod1;
            hs2 = (hs2 * 19260817 + s[j] - 'a' + 1) % mod2;
            ksj[i][j] = hs1 * 2000000000 + hs2;
        }
    }
    // ll ans = 0;
    for (int i = n; i >= 1; i--) {
        rep (j, i, n) {
           mp[ksj[i][j]]++;
        //    cout << ksj[i][j] <<' '<<mp[ksj[i][j]]<<endl;
        }
        int r = i-1;
        rep (l, 1, r) {
            // ans += mp[ksj[l][r]];
            int t = nxt[l][r];
            while (t >= l) {
                int len = t - l + 1;
                if (len * 2 < r-l+1) {
                    ans += mp[ksj[l+len][r-len]];
                }
                t = nxt[l][t];
            }
        }
    }
    cout << ans;
    return 0;
}