#include <bits/stdc++.h>
using namespace std;
string s;
const int mod1 = 1e9 + 7;
const int mod2 = 1e9 + 9;
typedef pair<int,int> pii;
typedef long long ll;
int bs1 = 31 , bs2 = 37;
pii h[805] , pw[805];
int n;
pii get(int l,int r) {
    return {(h[r].first - 1LL*h[l-1].first*pw[r-l+1].first%mod1 + mod1 )% mod1 , (h[r].second - 1LL*h[l-1].second*pw[r-l+1].second%mod2 + mod2) % mod2};
}
int pos[805];
int main() {
    ios::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0) ;
    cin >> s ; s = "#" + s; n = s.size() - 1;
    pw[0] = {1,1};
    for(int i = 1;i <= n;i++) {
        pw[i].first = 1LL * pw[i - 1].first * bs1 % mod1;
        pw[i].second = 1LL * pw[i - 1].second * bs2 % mod2;
    }

    for(int i = 1;i <= n;i++) {
        h[i].first = (1LL * h[i - 1].first * bs1 + s[i] - 'a') % mod1;
        h[i].second = (1LL * h[i - 1].second * bs2 + s[i] - 'a') % mod2;
    }
    ll ans = 0;
    
    for(int l = 1;l <= n;l++) {
        for(int r = l;r <= n;r++) {
            memset(pos,0,sizeof(pos)) ;
            int len = r - l + 1;
            int cnt = 0;
            pii ha = get(l , r);
            for(int i = l - 1;i >= len;i--) {
                if(get(i - len + 1 , i) == ha) {pos[i] = 1; cnt++;}
            }
            ans += cnt;
            for(int i = r + 1;i + len - 1 <= n;i++) {
                if(get(i , i + len - 1) == ha) {pos[i] = 1; cnt++;}
            }
            for(int i = 1;i <= min(l - 1 , n - r);i++) {
                if(pos[l - i]) cnt--;
                if(pos[r + i]) cnt--;
                if(get(l - i , l - 1) == get(r + 1, r + i)) {
                    // printf("%d %d : %d %d\n",l,r,i,cnt);
                    ans += cnt;
                }
            }
        }
    }
    cout << ans ; return 0;
}