#include <bits/stdc++.h>
using namespace std;
long long p[4500], dp1[4500], dp2[4500];
char b[4500];
void Manacher(char a[]) {
  memset(dp1, 0, sizeof(dp1));
  memset(dp2, 0, sizeof(dp2));
  memset(p, 0, sizeof(p));
  long long id = 0, mx = 0;
  int len = strlen(a);
  for (int i = 1; i < len; i++) {
    if (mx > i) {
      p[i] = min(p[id * 2 - i], mx - i);
    } else {
      p[i] = 1;
    }
    while (a[i - p[i]] == a[i + p[i]]) {
      p[i]++;
    }
    if (p[i] + i > mx) {
      mx = p[i] + i;
      id = i;
    }
  }
  for (int i = 1; i < len; i++) {
    for (int j = i; j < i + p[i]; j++) {
      dp1[j]++;
    }
  }
  for (int i = 1; i < len; i++) {
    for (int j = i; j > max((long long)0, i - p[i]); j--) {
      dp2[j]++;
    }
  }
  long long ans = 0;
  for (int i = 2; i < len; i += 2) {
    for (int j = i + 2; j < len; j += 2) {
      ans += dp1[i] * dp2[j];
    }
  }
  cout << ans << endl;
}
int main() {
  char a[4500];
  long long ans = 0;
  while (scanf("%s", a) != EOF) {
    b[0] = '$';
    int cnt = 1;
    int len = strlen(a);
    for (int i = 0; i < len; i++) {
      b[cnt++] = '#';
      b[cnt++] = a[i];
    }
    b[cnt++] = '#';
    b[cnt] = '\0';
    Manacher(b);
  }
  return 0;
}
