#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int const maxn = 2005;
int suff[maxn];
int h[maxn][maxn], cur;
map < char, int > nxt[805 * 805];

ll solve(string s, int type) {
    ll ans = 0;
    int n = s.size();
    s = "#" + s;
    cur = 1;
    for (int i = 1; i <= n; i++) {
        int node = 0;
        for (int j = i; j <= n; j++) {
            if (nxt[node].find(s[j]) == nxt[node].end()) nxt[node][s[j]] = cur++;
            node = nxt[node][s[j]];
            h[i][j] = node;
        }
    }
    for (int i = 0; i <= cur; i++) nxt[i] = {};
    for (int A = 1; A <= n; A++) {
        for (int B = A; B <= n; B++) {
            for (int pos = n; pos > B; pos--) {
                suff[pos] = suff[pos + 1];
                if (pos + B - A <= n) suff[pos] += (h[A][B] == h[pos][pos + B - A]);
            }
            for (int len = type; A - len >= 0 && B + len <= n; len++) {
                if (h[A - len][A - 1] == h[B + 1][B + len]) {
                    ans += suff[B + len + 1];
                }
            }
        }
    }
    return ans;
}

main() {
#ifdef HOME
    freopen("input.txt", "r", stdin);
#endif // HOME
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    string s;
    cin >> s;
    ll ans = solve(s, 1);
    reverse(s.begin(), s.end());
    ans += solve(s, 0);
    cout << ans << '\n';
    return 0;
}