#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>

#define PB push_back
#define X first
#define Y second

using namespace std;

typedef long long ll;
typedef pair < int, int > pii;

const int N = 805;

int n, weq[N][N], par[N];
char s[N];
vector < pii > spoji[N];
vector < int > jed[N];

int pr(int x) {
	if(par[x] == x) return par[x];
	return par[x] = pr(par[x]);
}

void mrg(int x, int y) {
	par[pr(x)] = pr(y);
}

int main(){
	scanf("%s", s);
	n = strlen(s);
	ll ans = 0;
	for(int bla = 0;bla < 2;bla++) {
		for(int i = 0;i < n;i++) par[i] = i;
		for(int i = n - 1;i >= 0;i--) {
			for(int j = n - 1;j > i;j--) {
				weq[i][j] = s[i] == s[j] ? (weq[i + 1][j + 1] + 1) : 0;
				if(weq[i][j] > 0 && weq[i][j] <= n / 2) { spoji[weq[i][j]].PB({i, j}); }
				if(weq[i][j] > n / 2) mrg(i, j);
			}
		}
		for(int len = n / 2;len >= 1;len--) {
			for(auto tmp : spoji[len]) mrg(tmp.X, tmp.Y);
			spoji[len].clear();
			for(int i = 0;i < n;i++) jed[i].clear();
			
			for(int i = n - len;i >= 0;i--) {
				if(i + len <= n - len) jed[pr(i + len)].PB(i + len);
				int moj = pr(i);
				int pok = jed[moj].size() - 1;
				for(int t = bla; t <= i && t + len + t <= n - len; t++) {
					if(weq[i - t][i + len] < t) continue;
					while(pok >= 0 && jed[moj][pok] < i + len + t) pok--;
					ans += pok + 1;
				}
			}
		}
		reverse(s, s + n);
	}
	printf("%lld\n", ans);
	return 0;
}