#include <bits/stdc++.h>
using namespace std;
const int N = 2010;
int dp[N][N];
long long pre[N];
string s;
long long power_mod(long long x, long long y) {
  x %= 1000000007;
  long long res = 1;
  while (y) {
    if (y & 1) {
      res = (res * x) % 1000000007;
    }
    y /= 2;
    x = (x * x) % 1000000007;
  }
  return res;
}
void solve() {
  cin >> s;
  int n = s.length();
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i <= n; i++) {
    dp[i][i] = 1;
  }
  for (int j = 2; j <= n; j++) {
    for (int i = 1; i < j; i++) {
      if (i == (j - 1) and s[j - 1] == s[i - 1]) {
        dp[i][j] = 1;
      } else if (dp[i + 1][j - 1] == 1 and s[i - 1] == s[j - 1]) {
        dp[i][j] = 1;
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    pre[i] += pre[i - 1];
    for (int j = i; j <= n; j++) {
      if (dp[i][j]) {
        ans += pre[i - 1];
        pre[j]++;
      }
    }
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int tc = 1;
  while (tc--) {
    solve();
  }
  return 0;
}
