#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000 + 7;
const double esp = 1e-13;
const double pi = 3.141592653589;
long long ans, d[2000 + 10];
bool f[2000 + 10][2000 + 10];
int n, j;
char s[2000 + 10];
int main() {
  cin >> (s + 1);
  memset(f, false, sizeof(f));
  n = strlen(s + 1);
  for (int i = (1), _b = (n); i <= _b; i++) {
    f[i][i] = true;
    if (s[i] == s[i + 1]) {
      f[i][i + 1] = true;
      f[i + 1][i] = true;
    }
  }
  for (int k = (1), _b = (n); k <= _b; k++)
    for (int i = (1), _b = (n - k); i <= _b; i++) {
      j = i + k;
      if (f[i + 1][j - 1] && s[i] == s[j]) {
        f[i][j] = true;
        f[j][i] = true;
      }
    }
  ans = 0;
  for (int i = (1), _b = (n); i <= _b; i++)
    for (int j = (i), _b = (n); j <= _b; j++)
      if (f[i][j]) d[j]++;
  for (int i = (1), _b = (n); i <= _b; i++) d[i] += d[i - 1];
  for (int i = (2), _b = (n); i <= _b; i++)
    for (int j = (i), _b = (n); j <= _b; j++)
      if (f[i][j]) ans += d[i - 1];
  cout << ans;
}
