# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { -1,0,1,0 }, dy[4] = { 0,-1,0,1 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)
# define INIT                 std::ios::sync_with_stdio(false);std::cin.tie(0)
# pragma warning(disable:4996)

struct Manacher {
	string s;
	vector<int> radius;

	Manacher(string str) {
		for (int i = 0; i < str.size(); i++) {
			if (i)s += "#";
			s += str[i];
		}
		radius.resize(s.size());

		int i = 0, j = 0;
		while (i < s.size()) {
			while (i - j >= 0 && i + j < s.size() && s[i - j] == s[i + j])++j;
			radius[i] = j;
			int k = 1;
			while (i - k >= 0 && i + k < s.size() && k + radius[i - k] < j)radius[i + k] = radius[i - k], ++k;
			i += k, j -= k;
		}
	}
	//[l,r]
	bool is_palindrome(int l, int r) {
		return radius[l + r] >= r - l + 1;
	}
};

string s;

int main() {
	cin >> s;
	Manacher mana(s);
	vector<LL> p1, p2(s.size()), sum(s.size());
	REP(i, s.size() - 3) {
		if (mana.is_palindrome(0, i))p1.emplace_back(i);
	}
	REP(i, p1.size()) {
		for (int j = p1[i] + 1; j < s.size() - 2; j++) {
			if (mana.is_palindrome(p1[i] + 1, j))p2[j]++;
		}
	}
	REP(i, s.size() - 1)sum[i + 1] = sum[i] + p2[i];
	LL ans = 0;
	for (int i = 2; i < s.size() - 1; i++) {
		if (mana.is_palindrome(i + 1, s.size() - 1))ans += sum[i];
	}
	cout << ans << endl;
}