#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;
inline long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
inline long long power(long long a, long long n, long long m) {
  if (n == 0) return 1;
  long long p = power(a, n / 2, m);
  p = (p * p) % m;
  if (n % 2)
    return (p * a) % m;
  else
    return p;
}
const long long MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
bool dp[2001][2001];
long long dp1[2001], dp2[2001];
int32_t main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  string s;
  cin >> s;
  long long n = s.length();
  for (long long i = 0; i < n; i++) dp[i][i] = 1;
  for (long long l = 2; l <= n; l++)
    for (long long i = 0; i <= n - l; i++) {
      long long j = i + l - 1;
      if (j == i + 1) {
        if (s[i] == s[j]) dp[i][j] = 1;
      } else {
        if (s[i] == s[j] && dp[i + 1][j - 1]) dp[i][j] = 1;
      }
    }
  for (long long i = 0; i < n; i++) {
    for (long long j = i; j < n; j++)
      if (dp[i][j]) dp1[i]++;
  }
  for (long long j = 0; j < n; j++)
    for (long long i = j; i >= 0; i--)
      if (dp[i][j]) dp2[j]++;
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    for (long long j = i + 1; j < n; j++) {
      ans = ans + dp2[i] * dp1[j];
    }
  }
  cout << ans << "\n";
  return 0;
}
