#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }

int main() {
	char S[5001];
	while (~scanf("%s", S)) {
		int n = (int)strlen(S);
		vector<vector<bool>> palin(n + 1, vector<bool>(n + 1));
		rep(i, n + 1) palin[i][i] = true;
		rep(i, n) palin[i][i + 1] = true;
		rer(len, 2, n) rer(i, 0, n - len) {
			int j = i + len;
			palin[i][j] = S[i] == S[j - 1] && palin[i + 1][j - 1];
		}
		ll ans = 0;
		rer(i, 2, n - 2) {
			int ways = 0;
			rer(k, 1, i - 1) if(palin[0][k] && palin[k][i])
				++ ways;
			rer(j, i + 1, n - 1) {
				if (palin[j][n])
					ans += ways;
			}
		}
		printf("%lld\n", ans);
	}
	return 0;
}