#include <bits/stdc++.h>
using namespace std;
string s;
typedef unsigned long long ull;
typedef long long ll;
ull bs = 31;
ull h[805];
ull pw[805];
int n;
ull get(int l,int r) {
    return (h[r] - h[l - 1]*pw[r-l+1]);
}
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;
    for(int i = 1;i <= n;i++) pw[i] = pw[i - 1] * bs;
    for(int i = 1;i <= n;i++) {
        h[i] = (h[i - 1] * bs + s[i] - 'a');
    }
    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;
            ull 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;
}