#include <bits/stdc++.h>
using namespace std;
string s;
int n;
bool g[2005][2005];
long long f[2005], res;
void precal() {
  for (int i = 0; i < n; i++) {
    g[i][i] = true;
    if (i < n - 1 && s[i] == s[i + 1]) g[i][i + 1] = true;
  }
  for (int l = 3; l <= n; l++)
    for (int i = 0; i < n - l + 1; i++) {
      int j = i + l - 1;
      g[i][j] = (s[i] == s[j] && g[i + 1][j - 1]);
    }
  for (int i = 0; i < n; i++)
    if (g[i][n - 1]) f[i]++;
}
int main() {
  if (0) {
    freopen("a.inp", "r", stdin);
  };
  getline(cin, s);
  n = s.length();
  precal();
  for (int i = n - 2; i >= 0; i--) {
    for (int j = i; j >= 0; j--) {
      if (!g[j][i]) continue;
      f[j]++;
      res += f[i + 1];
    }
    f[i] += f[i + 1];
  }
  printf("%I64d\n", res);
}
