#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);

	vector<unordered_map<ll, int>> pref(n+1), suf(n+1);
	Hash h(s);
	for (int i=0; i<n; i++) {
		pref[i+1] = pref[i];
		for (int j=0; j<=i; j++) pref[i+1][h(j, i+1)]++;
	}
	for (int i=n-1; i>=0; i--) {
		suf[i] = suf[i+1];
		for (int j=i; j<n; j++) suf[i][h(i, j+1)]++;
	}

	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 (h(i, i+use) == h(i+half, i+half+use)) {
					ll idk = h(i+use, i+half);
					ans += pref[i][idk];
					ans += suf[j+1][idk];
				}
			}
			ans += suf[j+1][h(i, j+1)];
		}
	}
	cout << ans << '\n';
}
 
int main() {
	cin.tie(0)->sync_with_stdio(false);
	cout << setprecision(16);
	solve();
}