#include <bits/stdc++.h>
using namespace std;
using namespace std;
long long power(long long b, long long e, long long m) {
  long long p = 1;
  while (e > 0) {
    if (e & 1) p = (p * b) % m;
    e = e >> 1;
    b = (b * b) % m;
  }
  return p;
}
string s;
bool isPal[2001][2001];
long long psh[2001], peh[2001];
int main() {
  long long n, i, t, j, h, k = 0, h1, h2, q, l, r, ans = 0;
  cin >> s;
  n = s.length();
  isPal[n - 1][n - 1] = true;
  for (i = 0; i < n - 1; i++) {
    isPal[i][i] = true;
    if (s[i] == s[i + 1]) {
      isPal[i][i + 1] = true;
    }
  }
  for (i = 2; i < n; i++) {
    for (j = 0; j + i < n; j++) {
      isPal[j][j + i] = isPal[j + 1][j + i - 1] && (s[j] == s[j + i]);
    }
  }
  peh[0] = psh[n - 1] = 1;
  for (i = 1; i < n; i++) {
    peh[i] = peh[i - 1];
    for (j = 0; j <= i; j++) {
      peh[i] += isPal[j][i];
    }
  }
  for (i = n - 2; i >= 0; i--) {
    for (j = i; j < n; j++) {
      psh[i] += isPal[i][j];
    }
  }
  for (i = 0; i < n - 1; i++) {
    ans += peh[i] * psh[i + 1];
  }
  printf("%lld\n", ans);
  return 0;
}
