#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const double EPS = 1e-9;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
string str;
int flag[2010][2010];
int sumfrom[2010], sumto[2010];
int determine(int l, int r) {
  if (flag[l][r] == -1) {
    if (r - l <= 0) return flag[l][r] = 1;
    return flag[l][r] = (str[l] == str[r] ? 1 : 0) & determine(l + 1, r - 1);
  }
  return flag[l][r];
}
int main() {
  cin >> str;
  int n = str.size();
  for (int i = 0; i <= n; i++) {
    sumfrom[i] = 0;
    sumto[i] = 0;
    for (int j = 0; j <= n; j++) {
      flag[i][j] = -1;
    }
  }
  for (int i = 0; i <= n; i++) {
    for (int j = i; j <= n; j++) {
      if (determine(i, j)) {
        sumfrom[i]++;
        sumto[j]++;
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      ans += sumto[i] * sumfrom[j];
    }
  }
  cout << ans << endl;
  return 0;
}
