#include <bits/stdc++.h>
using namespace std;
const int max_n = 2010;
int n;
char s[max_n + 10];
int l[max_n + 1] = {0}, r[max_n + 1] = {0}, R[max_n + 1] = {0};
bool P[max_n + 1][max_n + 1];
int main() {
  scanf("%s", s);
  for (int i = 0; true; ++i) {
    if (s[i] == '\0') {
      n = i;
      break;
    } else {
      P[i][i + 1] = true;
      ++l[i + 1];
      ++r[i];
    }
  }
  for (int i = 0; i <= n; ++i) P[i][i] = true;
  for (int k = 2; k <= n; ++k) {
    for (int i = 0; i <= n - k; ++i) {
      int j = i + k;
      P[i][j] = ((P[i + 1][j - 1]) and (s[i] == s[j - 1]));
      if (P[i][j]) {
        ++r[i];
        ++l[j];
      }
    }
  }
  R[n] = 0;
  for (int i = n - 1; i >= 0; --i) R[i] = R[i + 1] + r[i];
  long long res = 0;
  for (int i = 0; i <= n; ++i) res += ((long long)(l[i])) * ((long long)(R[i]));
  cout << res << endl;
  return 0;
}
