#include <bits/stdc++.h>
using namespace std;
int main() {
  string str;
  cin >> str;
  int n = str.size();
  int dp[n][n];
  memset(dp, 0, sizeof(dp));
  for (int i = 0; i < n; i++) dp[i][i] = 1;
  for (int i = 0; i < n - 1; i++) {
    if (str[i] == str[i + 1])
      dp[i][i + 1] = 1;
    else
      dp[i][i + 1] = 0;
  }
  for (int l = 3; l <= n; l++) {
    for (int j = 0; j <= n - l; j++) {
      if (str[j] == str[j + l - 1]) dp[j][j + l - 1] = dp[j + 1][j + l - 2];
    }
  }
  long long int Array[n];
  Array[0] = 1;
  for (int j = 1; j < n; j++) {
    Array[j] = Array[j - 1];
    for (int i = 0; i <= j; i++) Array[j] += dp[i][j];
  }
  long long int Array1[n - 1];
  Array1[n - 1] = 1;
  for (int j = n - 2; j >= 0; j--) {
    Array1[j] = Array1[j + 1];
    for (int i = j; i < n; i++) {
      Array1[j] += dp[j][i];
    }
  }
  long long int ans = 0;
  for (int i = 0; i < n - 1; i++) {
    int x = Array[i];
    if (i != 0) x -= Array[i - 1];
    ans += (x * Array1[i + 1]);
  }
  cout << ans << "\n";
}
