#include <bits/stdc++.h>
using namespace std;
const int N = 4024;
int a[N], n, an;
int f[N];
long long g[N], res;
char s[N];
inline bool check(int x, int y) {
  if (x < 0) return 0;
  if (y > n) return 0;
  if (a[x] != a[y]) return 0;
  return 1;
}
int main() {
  scanf("%s", s);
  n = strlen(s);
  for (int i = 1; i <= n; i++) {
    a[++an] = s[i - 1] - 'a' + 1;
    a[++an] = 0;
  }
  --an;
  n = an;
  for (int i = 1; i <= n; i++) {
    f[i] = 1;
    while (check(i - f[i], i + f[i])) ++f[i];
  }
  res = 0;
  for (int i = 1; i <= n; i++)
    for (int j = (i & 1) ? i : i + 1; j <= i + f[i] - 1; j += 2) g[j]++;
  g[0] = 0;
  for (int i = 1; i <= n; i++) g[i] += g[i - 1];
  for (int i = 1; i <= n; i++)
    for (int j = (i & 1) ? i : i - 1; j >= i - f[i] + 1; j -= 2)
      res += g[j - 1];
  cout << res << endl;
  return 0;
}
