#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int P[5050][5050];
int cnt[5050];
string S;
void dp_go(int be, int en){//[be, en)
  if (P[be][en] != -1) {
    return;
  }
  if (en - be == 1) {
    P[be][en] = 1;
    return;
  }
  if (en - be == 2) {
    if (S[be] == S[en - 1]) {
      P[be][en] = 1;
    } else {
      P[be][en] = 0;
    }
    return;
  }
  dp_go(be+1, en);
  dp_go(be, en-1);
  dp_go(be+1, en-1);
  if (P[be+1][en-1] && S[be] == S[en-1]) {
    P[be][en] = 1;
  } else {
    P[be][en] = 0;
  }
  return;
}

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  mem(P, -1);
  cin >> S;
  int N = sz(S);
  dp_go(0,N);

  //cnt[x] = [0,y),[y,x)が回分になる個数

  for (int x = 0; x < N; x++) {
    for (int y = 1; y < x; y++) {
      if (P[0][y] && P[y][x]) {
        cnt[x] += 1;
      }
    }
  }
  ll ans = 0;

  //[0,x) [x,y) [y,N)の組み合わせ
  for (int x = 1; x < N; x++) {
    for (int y = x + 1; y < N; y++) {
      if (P[y][N]) {
        ans += cnt[x];
      }
    }
  }
  cout << ans << endl;
  return 0;
}