#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=800;
const int g=27,mod=998244353;
int n;
char s[N+5];
int hv[N+5][N+5];
unordered_map<int,int> cnt[N+5],cnt2[N+5];
ll ans;
int main(){
    scanf("%s",s+1);
    n=strlen(s+1);
    for(int i=1;i<=n;i++)
        for(int j=i;j<=n;j++){
            hv[i][j]=(1ll*hv[i][j-1]*g+s[j]-'a'+1)%mod;
            for(int k=1;k<=i;k++)
                cnt[k][hv[i][j]]++;
            for(int k=j;k<=n;k++)
                cnt2[k][hv[i][j]]++;
        }
    for(int d=1;d<=n/2;d++){
        for(int i=1;i<=n;i++){
            for(int j=i+d-1;j<=n&&j-i+1<2*d;j++){
                if(hv[i][j-d]==hv[i+d][j])
                    ans+=cnt[j+1][hv[j-d+1][i+d-1]];
            }
        }
        for(int i=1;i<=n;i++)
            for(int j=i+d;j<=n&&j-i+1<2*d;j++){
                if(hv[i][j-d]==hv[i+d][j])
                    ans+=cnt2[i-1][hv[j-d+1][i+d-1]];
            }
    }
    printf("%lld\n",ans);
    return 0;
}