#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

struct RollingHash{
  using ull = unsigned long long;
  vector<ull> hash,p;
  RollingHash(){}
  RollingHash(const string &s,ull B=1000000007LL){
    int n=s.size();
    hash.assign(n+1,0);
    p.assign(n+1,1);
    for(int i=0;i<n;i++){
      hash[i+1]=hash[i]*B+s[i];
      p[i+1]=p[i]*B;
    }
  }
  //S[l, r)
  ull find(int l,int r){
    return hash[r]-hash[l]*p[r-l];
  }
};

//INSERT ABOVE HERE
signed main(){
  string s;
  cin>>s;
  int n=s.size();
  
  string t=s;
  reverse(t.begin(),t.end());

  RollingHash rs(s),rt(t);
  auto check=[&](int l,int r){
               return rs.find(l,r)==rt.find(n-r,n-l);
             };
  
  vector<int> dp(n+1,0);
  for(int r=1;r<=n;r++)
    for(int m=1;m<r;m++)
      dp[r]+=check(0,m)&&check(m,r);
  
  Int ans=0;
  for(int i=0;i<n;i++)
    for(int j=i+1;j<n;j++)
      if(check(j,n)) ans+=dp[i];

  cout<<ans<<endl;
  return 0;
}