#include <bits/stdc++.h>
using namespace std;
char s[2010];
int len;
int l[2010];
int r[2010];
bool dp[2010][2010];
long long ret;
int main() {
  scanf("%s", s);
  len = strlen(s);
  memset(dp, 0, sizeof(dp));
  memset(l, 0, sizeof(l));
  memset(r, 0, sizeof(r));
  for (int i = 0; i < len; ++i) dp[i][i] = true;
  for (int i = 0; i < len - 1; ++i)
    if (s[i] == s[i + 1]) dp[i][i + 1] = true;
  for (int k = 2; k < len; ++k) {
    for (int i = 0; i + k < len; ++i) {
      dp[i][i + k] = (s[i] == s[i + k]) && dp[i + 1][i + k - 1];
    }
  }
  for (int i = 0; i < len; ++i) {
    for (int j = i; j >= 0; --j) {
      l[i] += dp[j][i];
    }
    for (int j = i; j < len; ++j) {
      r[i] += dp[i][j];
    }
  }
  ret = 0LL;
  for (int i = 0; i < len; ++i) {
    for (int j = i + 1; j < len; ++j) {
      ret += (long long)l[i] * (long long)r[j];
    }
  }
  cout << ret << endl;
  return 0;
}
