#include<bits/stdc++.h> 
#define int long long 
#define x first 
#define y second 
#define il inline 
#define em emplace 
#define eb emplace_back 
#define debug() puts("-----") 
using namespace std; 
typedef pair<int,int> pii; 
il int read(){ 
	int x=0,f=1; char ch=getchar(); 
	while(ch<'0'||ch>'9'){ if(ch=='-') f=-1; ch=getchar(); } 
	while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar(); 
	return x*f; 
} 
const int N=810; 
int n; 
char a[N]; 
int mp[N][N]; 
int tr[N*N][26],idx=0; 
signed main(){ 
	cin>>a+1; n=strlen(a+1); 
	for(int i=1;i<=n;i++){ 
		int u=0; 
		for(int j=i;j<=n;j++){ 
			int x=a[j]-'a'; 
			if(!tr[u][x]) tr[u][x]=++idx; 
			u=tr[u][x],mp[i][j]=u; 
		} 
	} int ans=0; 
	for(int i=1;i<=n;i++){ 
		for(int j=i;j<=n;j++){ 
			int len=j-i+1,cnt=0; 
			for(int k=j;k<=n-len+1;k++){ 
				int l=k-j; 
				if(mp[i][j]==mp[k][k+len-1]) ans+=cnt; 
				if(i>l&&mp[i-l][i-1]==mp[j+1][k]) cnt++; 
			} cnt=0; 
			for(int k=i;k>=len;k--){ 
				int l=i-k; 
				if(mp[k-len+1][k]==mp[i][j]) ans+=cnt; 
				if(k!=i&&j+l<=n&&mp[k][i-1]==mp[j+1][j+l]) cnt++; 
			} 
		} 
	} printf("%lld\n",ans); 
	return 0; 
}