#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 800 + 5;

int n;
char s[MAXN];

pair<ll,ll> getres(void)
{
	ll res1 = 0, res2 = 0;
	
	static int cnt[MAXN][MAXN];
	memset(cnt, 0, sizeof(cnt));
	
	for(int i=1; i<=n; ++i)
	{
		for(int j=i+1; j<=n; ++j)
		{
			for(int k=1; i+k<=j-1 && j+k-1<=n; ++k)
			{
				if(s[i+k-1] != s[j+k-1]) break;
				res1 += cnt[i+k][j-1];
			}
		}
		
		for(int j=i+1; j<=n; ++j)
		{
			for(int k=1; i-k+1>=1 && j-k+1>i; ++k)
			{
				if(s[i-k+1] != s[j-k+1]) break;
				++cnt[j-k+1][j];
				++res2;
			}
		}
	}
	
	return {res1, res2};
}

int main(void)
{
	scanf("%s",s+1);
	n = strlen(s+1);
	
	ll ans = 0;
	
	auto t = getres();
	ans += t.first + t.second;
	
	reverse(s+1, s+n+1);
	t = getres();
	ans += t.first;
	
	printf("%lld\n",ans);
	return 0;
}