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