#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int p[N][N];
int le[N], ri[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s1;
  string s = " ";
  cin >> s1;
  s += s1;
  int n = s.size();
  n--;
  for (int i = 1; i <= n; i++) p[i][i] = 1;
  for (int l = 2; l <= n; l++) {
    for (int i = 1; i <= n - l + 1; i++) {
      int j = i + l - 1;
      if (l == 2)
        p[i][i + 1] = (s[i] == s[j]);
      else
        p[i][j] = (s[i] == s[j]) && p[i + 1][j - 1];
    }
  }
  for (int j = 1; j <= n; j++) {
    int cnt = 0;
    for (int i = 1; i <= j; i++) {
      if (p[i][j]) cnt++;
    }
    le[j] = cnt;
  }
  for (int j = n; j >= 1; j--) {
    int cnt = 0;
    for (int i = j; i <= n; i++) {
      if (p[j][i]) cnt++;
    }
    ri[j] = ri[j + 1] + cnt;
  }
  long long sum = 0;
  for (int i = 1; i <= n - 1; i++) {
    sum = sum + (le[i] * (1ll) * ri[i + 1]);
  }
  cout << sum << endl;
  return 0;
}
