#include <bits/stdc++.h>
#define inf (0x7f7f7f7f)
#define Min(a, b) ((a) < (b) ? (a) : (b))
#define Max(a, b) ((a) > (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
	int ch = 0, f = 0; x = 0;
	for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = 1;
	for(; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
	if(f) x = -x;
}
const int mod = 1e9 + 7, N = 805;
char s[N];
ll ans;
int nxt[N], st[N*N], buf[N*N], nor[N*N], n, cnt;
#define id(x, y) (((x) - 1) * n + (y))
inline void gao(char* str, int m, int l){
	for(int i = 2, j = 0; i <= m; nxt[i++] = j){
		while(j && str[j+1] != str[i]) j = nxt[j];
		if(str[j+1] == str[i]) j++;
	}
	cnt = 0;
	for(int t = m; t; t = nxt[t]) if(t * 2 < m){
		ans += buf[nor[id(l + t, l + m - 1 - t)]];
	}
}
int main(){
	scanf("%s", s + 1);
	n = strlen(s + 1);
	unordered_map<int, int> fir;
	for(int i = 1; i <= n; i++)
		for(int j = i, hsh = 0; j <= n; j++){
			hsh = (97ll * hsh + s[j]) % mod;
			if(!fir.count(hsh)) fir[hsh] = id(i, j);
			nor[id(i, j)] = fir[hsh];
		}
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= i - 1; j++) buf[nor[id(j, i - 1)]]++;
		for(int j = n; j >= i + 1; j--){
			for(int k = j + 1; k <= n; k++) buf[nor[id(j + 1, k)]]++;
			gao(s + i - 1, j - i + 1, i);
		}
		for(int j  = n; j >= i + 1; j--)
			for(int k = j + 1; k <= n; k++) buf[nor[id(j + 1, k)]]--;
	}
	for(int i = 1; i <= n * n; i++) buf[i] = 0;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= i - 1; j++) buf[nor[id(j, i - 1)]]++;
		for(int j = i; j <= n; j++){
			ans += buf[nor[id(i, j)]];
			//cout << i << " " << j << " " << buf[nor[id(i, j)]] << endl;
		}
	}
	cout << ans << endl;
	return 0;
}