#include <bits/stdc++.h>
using namespace std;
using ll = long long;

string doll(const string& S) {
	int N = S.size();
	if (N == 0) return S;
	string res; res.push_back(S[0]);
	for (int i = 1; i < N; i++) {
		res.push_back('$');
		res.push_back(S[i]);
	}
	return res;
}

vector<int> Manacher(const string& S) {
	int N = S.size();
	vector<int> R(N + 1);
	int i = 0, j = 0;
	while (i < N) {
		while (i - j >= 0 && i + j < N && S[i - j] == S[i + j]) j++;
		R[i] = j;
		int k = 1;
		while (i - k >= 0 && i + k < N && k + R[i - k] < j) {
			R[i + k] = R[i - k];
			k++;
		}
		i += k;
		j -= k;
	}
	return R;
}

int main()
{
	string S;
	cin >> S;
	int N = S.size();
	auto A = Manacher(doll(S));
	vector<ll> dp(N);
	for (int i = N - 1, j = 0; i >= 0; i--) {
		dp[i] = A[N - 1 + i] == N - i ? ++j : j;
	}
	ll res = 0;
	for (int i = 0; i < N - 3; i++) {
		if (A[i] == i + 1) {
			for (int j = i + 1; j < N - 2; j++) {
				if (A[i * 2 + 1 + (j - i)] >= j - i) {
					res += dp[j + 2];
				}
			}
		}
	}
	cout << res << endl;
	return 0;
}