#include <bits/stdc++.h>
int l, pal[2002][2002];
using namespace std;
long long sum[2002], dp[2002];
int main() {
  string s;
  cin >> s;
  l = (int)(s.size());
  dp[0] = 0;
  for (int i = (0); i <= (l - 1); i++) {
    int p = i, rp = 0;
    while (p - rp >= 0 && p + rp < l && s[p - rp] == s[p + rp]) {
      pal[p - rp][p + rp] = 1;
      rp++;
    }
    rp = 0;
    p = i;
    while (p - rp >= 0 && p + rp + 1 < l && s[p - rp] == s[p + rp + 1]) {
      pal[p - rp][p + rp + 1] = 1;
      rp++;
    }
  }
  sum[0] = 1;
  for (int i = (1); i <= (l - 1); i++) {
    sum[i] = sum[i - 1];
    for (int j = (0); j <= (i); j++)
      if (pal[j][i] == 1) sum[i]++;
  }
  for (int i = (1); i <= (l - 1); i++) {
    dp[i] = dp[i - 1];
    for (int j = (1); j <= (i); j++) dp[i] += pal[j][i] * sum[j - 1];
  }
  cout << dp[l - 1] << endl;
  return 0;
}
