#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
#pragma warning(disable : 4996)
using namespace std;
const int MAXN = 30001;
const int inf = 1000000000;
const long long INF = 1ll * inf * inf;
const long double EPS = 1e-7;
const int mod7 = inf + 7;
int hp = 29;
signed main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  ;
  string s;
  cin >> s;
  long long n = s.size();
  vector<vector<bool>> pal(n, vector<bool>(n));
  for (long long l = n - 1; l >= 0; --l) {
    for (long long r = l; r < n; ++r) {
      if (l == r)
        pal[l][r] = 1;
      else if (r - l == 1)
        pal[l][r] = (s[l] == s[r]);
      else {
        pal[l][r] = (pal[l + 1][r - 1] & (s[l] == s[r]));
      }
    }
  }
  vector<long long> sum(n);
  for (long long i = 0; i < n; ++i) {
    for (long long j = i; j >= 0; --j) {
      if (pal[j][i]) {
        sum[i]++;
      }
    }
    sum[i] += (i == 0 ? 0 : sum[i - 1]);
  }
  vector<long long> dp(n);
  for (long long i = 1; i < n; ++i) {
    for (long long j = i; j >= 1; --j) {
      dp[i] += sum[j - 1] * pal[j][i];
    }
    dp[i] += dp[i - 1];
  }
  cout << dp[n - 1];
}
