#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

char s[525252];
char ss[1252525];
int n,m;

int mana[1252525];
int headpal[525252];
int tailpal[525252];

int main(){
  scanf("%s",s);
  n = strlen(s);
  for(int i=0;i<n;i++){
    ss[2*i] = s[i];
    ss[2*i+1] = '$';
  }
  m = 2*n-1;
  // manacher
  {
    int i=0,j=0;
    while(i<m){
      while(i-j>=0 && i+j<m && ss[i-j]==ss[i+j])j++;
      mana[i] = j;
      int k=1;
      while(i-k>=0 && i+k<m && k+mana[i-k]<j){
        mana[i+k] = mana[i-k];
        k++;
      }
      i += k;
      j -= k;
    }
  }
  // headpal, tailpal
  vector<int> hps;
  for(int i=0;i<n;i++){
    headpal[i] = mana[i]>i;
    if(headpal[i]==1){
      hps.push_back(i+1);
    }
  }
  for(int i=n-1;i>0;i--){
    tailpal[i-1] = tailpal[i] + (mana[n+i-1]>n-i-1);
  }
  ll ans = 0;
  for(int c=2;c<n-1;c++){
    int rval = tailpal[c];
    for(auto j : hps){
      if(j>=c)break;
      if(mana[c+j-1]>c-j-1)ans += rval;
    }
  }
  printf("%lld\n",ans);
  return 0;
}