#include <bits/stdc++.h>
using namespace std;
const int mx = 2e3 + 12;
const int inf = 1e9 + 123;
long long f[mx], p[mx];
string s;
int main() {
  cin >> s;
  for (int i = 0; i < s.size(); i++) {
    f[i] = 0;
    p[i] = 1;
  }
  queue<long long> que;
  que.push(0);
  for (int i = 1; i < s.size(); i++) {
    que.push(i);
    long long cs = que.size();
    for (int j = 1; j <= cs; j++) {
      long long tj = que.front();
      que.pop();
      if (tj != 0 && s[i] == s[tj - 1]) {
        p[i]++;
        que.push(tj - 1);
      }
    }
    p[i] += p[i - 1];
    que.push(i);
  }
  queue<long long> que1;
  que1.push(0);
  for (int i = 1; i < s.size(); i++) {
    que1.push(i);
    f[i] += f[i - 1] + p[i - 1];
    long long cs = que1.size();
    for (int j = 1; j <= cs; j++) {
      long long tj = que1.front();
      que1.pop();
      if (tj != 0 && s[i] == s[tj - 1]) {
        f[i] += p[tj - 2];
        que1.push(tj - 1);
      }
    }
    que1.push(i);
  }
  cout << f[s.size() - 1];
  return 0;
}
