#include <bits/stdc++.h>
using namespace std;
bool vv[2000][2000];
int main() {
  int n;
  string s;
  cin >> s;
  long long left[2000], right[2000];
  for (int i = 0; i < s.length(); i++) {
    vv[i][i] = true;
  }
  int sm = 1, cp = s.length() - 1;
  for (; sm < s.length(); sm++) {
    for (int i = sm, j = 0; i < s.length(); i++, j++) {
      if (s[j] == s[j + sm] && (sm == 1 || vv[j + 1][j + sm - 1])) {
        vv[j][j + sm] = true;
      } else {
        vv[j][j + sm] = false;
      }
    }
  }
  for (int i = 0; i < s.length(); i++) {
    left[i] = 1;
    right[i] = 1;
    for (int j = 0; j < i; j++) {
      if (vv[j][i]) left[i]++;
      if (vv[s.length() - (i + 1)][s.length() - (j + 1)]) right[i]++;
    }
  }
  long long res = 0, right_sum = 0;
  for (int i = 0; i < s.length() - 1; i++) right_sum += right[i];
  for (int i = 0; i < s.length() - 1; i++) {
    res += left[i] * right_sum;
    right_sum -= right[s.length() - (i + 2)];
  }
  cout << res << endl;
  return 0;
}
