#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=8e2+5,M=100+5,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m;int pre[N][N],suf[N][N];
char s[N];
ll ans;
void Solve(){
	int i,j,h;scanf("%s",s+1);n=strlen(s+1);
	for(i=1;i<=n;i++){
		for(j=i+1;j<=n;j++){
			int x=0;while(i+x<=n&&j+x<=n&&s[i+x]==s[j+x]) x++;
			suf[i][j]=x; 
			x=0;while(i-x>=1&&j-x>=1&&s[i-x]==s[j-x]) x++;
			pre[i][j]=x;
		}
	}
	for(i=1;i<=n;i++){
		for(j=i;j<=n;j++){
			int len=j-i+1;
			for(h=j+len;h<=n;h++) if(pre[j][h]>=len) ans++;
		}
	}
	for(i=1;i<=n;i++){
		for(j=i;j<=n;j++){
			int len=j-i+1;
			for(h=j+len;h<=n;h++){
				ans+=max(min(suf[i][j+1],len-1)+min(pre[j][h],len-1)-len+1,0);
			}
			for(h=i-len;h>0;h--){
				ans+=max(min(suf[h][i],len-1)+min(pre[i-1][j],len-1)-len+1,0);
			}
		}
	}
	printf("%lld\n",ans);
}
int main(){
	int t;
	// scanf("%d",&t);
	t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}