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

#define tsolve int t; cin >> t; while(t--) solve
#define debug(x) cerr << __LINE__ << ": "#x" = " << (x) << endl
#define nl '\n'
#define all(x) ::begin(x), ::end(x)
#define sz(x) (int)::size(x)
using ll = long long;
using ld = long double;

using ull = uint64_t;
struct Hash {
	static constexpr ll M = 3.1e18L + 7;
	static constexpr ll Q = 19283928934LL;
	vector<ll> pref = {0};
	vector<ll> power = {1};
	string s;

	Hash(const string& s2) {
		s = s2;
		for (auto c : s) pref.push_back((mul(pref.back(), Q) + c) % M);
		while (ssize(power) <= ssize(s)) power.push_back(mul(power.back(), Q));
	}

	ll operator()(int l, int r) {
		return (pref[r] - mul(power[r-l], pref[l]) + M) % M;
	}

	static ll mul(ull a, ull b) {
		ll ans = (a * b - M * ull(1.L / M * a * b));
		return ans + M * ((ans < 0) - (ans >= M));
	}
};

void solve() {
    string s;
	cin >> s;
	int n = ssize(s);

	unordered_map<ll, int> pref, suf;
	Hash h(s);

	vector<vector<ll>> h2(n+1, vector<ll>(n+1));
	for (int i=0; i<=n; i++) {
		for (int j=i; j<=n; j++) h2[i][j] = h(i, j);
	}
	
	ll ans = 0;
	for (int i=0; i<n; i++) {
		for (int j=i; j<n; j++) {
			for (int k=1; k<(j-i)+1; k++) {
				if ((j-i+1+k) % 2 != 1) continue;
				int half = (j-i+1+k) / 2;
				int use = (j-i+1) - half;
				
				if (h2[i][i+use] == h2[i+half][i+half+use]) {
					ll idk = h2[i+use][i+half];
					ans += pref[idk];
				}
			}
			ans += pref[h2[i][j+1]];
		}

		for (int j=0; j<=i; j++) pref[h2[j][i+1]]++;
	}

	for (int j=n-1; j>=0; j--) {
		for (int i=0; i<=j; i++) {
			for (int k=1; k<(j-i)+1; k++) {
				if ((j-i+1+k) % 2 != 1) continue;
				int half = (j-i+1+k) / 2;
				int use = (j-i+1) - half;
				
				if (h2[i][i+use] == h2[i+half][i+half+use]) {
					ll idk = h2[i+use][i+half];
					ans += suf[idk];
				}
			}
		}
		for (int i=j; i<n; i++) suf[h2[j][i+1]]++;
	}

	cout << ans << '\n';
}
 
int main() {
	cin.tie(0)->sync_with_stdio(false);
	cout << setprecision(16);
	solve();
}