#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LLONG_MAX / 4;
bool chmin(ll& a, ll b) { if(a <= b) return 0; a = b; return 1; }
bool chmax(ll& a, ll b) { if(a >= b) return 0; a = b; return 1; }
#define all(a) begin(a), end(a)
#define rep(i,a,b) for(ll i = a; i < b; i++)


int main() {
    cin.tie(0)->sync_with_stdio(0);
    string S;
    cin >> S;
    const ll N = S.size();

    ll ans = 0;
    rep(i, 0, 2) {
        reverse(S.begin(), S.end());
        vector table1(N + 1, vector<ll>(N + 1));
        vector table2(N + 1, vector<ll>(N + 1));
        for (ll i = N; i--;) for (ll j = N; j--;) {
            if (S[i] == S[j]) table1[i][j] = table1[i + 1][j + 1] + 1;
        }
        rep(i, 0, N) rep(j, 0, N) {
            if (S[i] == S[j]) table2[i + 1][j + 1] = table2[i][j] + 1;
        }

        rep(L, 0, N) for (ll C = 1; L + C + C <= N; C++) rep(R, L + C + C, N + 1) {
            const ll len_L = min(C - 1, table1[L][L + C]);
            const ll len_R = min(C - i, table2[L + C][R]);
            if (len_L + len_R >= C) ans += len_L + len_R - C + 1;
        }
    }
    cout << ans << endl;
}