#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")


#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

vector< int > manacher(const string &s) {
  vector< int > radius(s.size());
  int i = 0, j = 0;
  while(i < s.size()) {
    while(i - j >= 0 && i + j < s.size() && s[i - j] == s[i + j]) {
      ++j;
    }
    radius[i] = j;
    int k = 1;
    while(i - k >= 0 && i + k < s.size() && k + radius[i - k] < j) {
      radius[i + k] = radius[i - k];
      ++k;
    }
    i += k;
    j -= k;
  }
  return radius;
}

int main(){
  string s;cin >> s;
  string t;
  rep(i,s.size()){
    t+=s[i];t+="$";
  }
  t.pop_back();
  ll n=s.size();
  vvl pal(n,vl(n+1));
  auto f=manacher(s);
  rep(i,n){
    ll left=i,right=i+1;
    rep(_,f[i]){
      pal[left][right]++;
      left--;right++;
    }
  }
  auto g=manacher(t);
  rep(i,n-1){
    ll left=i,right=i+2;
    rep(_,g[i*2+1]/2){
      pal[left][right]++;
      left--;right++;
    }
  }
  /*rep(i,n){
    rep(j,n+1)cout << pal[i][j] <<" ";cout << endl;
  }*/
  vvl dp(n+1,vl(4));
  rep(i,n+1)dp[i][0]=pal[0][i];
  rep(i,n){
    rep(j,3){
      for(ll k=i+1;k<=n;k++){
        if(j==0||j==2){
          if(pal[i][k])dp[k][j+1]+=dp[i][j];
        }
        else {
          dp[k][j+1]+=dp[i][j];
        }
      }
    }
  }
  /*rep(i,n){
    rep(j,4)cout << dp[i][j] <<" ";cout << endl;
  }*/
  cout << dp[n][3] << endl;
}