#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define fe first
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define Edg int M=0,fst[SZ],vb[SZ],nxt[SZ];void ad_de(int a,int b){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;}void adde(int a,int b){ad_de(a,b);ad_de(b,a);}
#define Edgc int M=0,fst[SZ],vb[SZ],nxt[SZ],vc[SZ];void ad_de(int a,int b,int c){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;vc[M]=c;}void adde(int a,int b,int c){ad_de(a,b,c);ad_de(b,a,c);}
#define es(x,e) (int e=fst[x];e;e=nxt[e])
#define esb(x,e,b) (int e=fst[x],b=vb[e];e;e=nxt[e],b=vb[e])
#define SZ 66666
int n;
const int MOD=1000000007;
ll cm[SZ],cmn[SZ];
ll qp(ll a,ll b)
{
    ll ans=1;
    while(b)
    {
        if(b&1) ans=ans*a%MOD;
        a=a*a%MOD; b>>=1;
    }
    return ans;
}
struct HashKMP
{
char s[SZ+1]; int n;
ll hash[SZ+1];
void pre()
{
    n=strlen(s);
    for(int i=n-1;i>=0;i--) hash[i]=(hash[i+1]+cm[n-1-i]*(s[i]-'a'+1)%MOD)%MOD;
}
inline ll ghash(int l,int r)
{
    return ((hash[l]-hash[r+1])*cmn[n-1-r]%MOD+MOD)%MOD;
}
}a,b;
inline ll hsh(int l,int r)
{return a.ghash(n-r,n-l);}
inline ll hshf(int l,int r)
{return b.ghash(l-1,r-1);}
char s[SZ];
int wo[1005][1005];
int main()
{
    cm[0]=cmn[0]=1; ll gg=qp(129,MOD-2);
    for(int i=1;i<SZ;i++) cm[i]=cm[i-1]*129%MOD;
    for(int i=1;i<SZ;i++) cmn[i]=cmn[i-1]*gg%MOD;
	scanf("%s",s+1); n=strlen(s+1);
	reverse(s+1,s+1+n);
	strcpy(a.s,s+1);
	reverse(s+1,s+1+n);
	strcpy(b.s,s+1);
	a.pre(); b.pre();
	ll ans=0;
	for(int i=1;i<=n;++i)
		for(int j=1;i+j<=n;++j)
		{
			if(s[i]!=s[i+j]) wo[i][i+j]=0;
			else wo[i][i+j]=wo[i-1][i+j+1]+1;
			ans+=wo[i][i+j];
		}
	for(int i=1;i<=n;++i)
	{
		int g=-1;
		for(int j=i+1;j<=n;++j)
		{
			g+=hsh(i+1,j-1)==hshf(i+1,j-1);
			ans+=g*wo[i][j];
		}
	}
	for(int i=n;i>=1;--i)
	{
		int g=-1;
		for(int j=i-1;j>=1;--j)
		{
			g+=hsh(j+1,i-1)==hshf(j+1,i-1);
			ans+=g*wo[j][i];
		}
	}
	cout<<ans<<"\n";
}