#include <bits/stdc++.h>

#define f first
#define s second
#define sz(s) (int)s.size()
#define pb push_back

using namespace std;

using vi = vector<int>;

const int N = (int)5e3 + 100;

string s, t;
int n, m;

const int p[] = {(int)1e6 + 33, (int)1e6 + 7};
const int mod[] = {(int)1e9 + 7, (int)1e9 + 9};
int h[N][2];
int pw[N][2];

inline pair<int, int> get(int l, int r){
	int a = (h[r][0] - pw[r - l + 1][0] * 1ll * h[l - 1][0] % mod[0]);
	int b = (h[r][1] - pw[r - l + 1][1] * 1ll * h[l - 1][1] % mod[1]);
	
	if(a < 0)
		a += mod[0];
	if(b < 0)
		b += mod[1];
	return {a, b};
}


struct HASH{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

unordered_map<pair<int, int>, int, HASH> cnt[N], cnt1[N];
main(){
	ios_base :: sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	cin >> s;
	n = s.size();
	pw[0][0] = pw[0][1] = 1;

	for(int i = 0; i < n; i++){
		for(int it = 0; it < 2; it++){
			h[i + 1][it] = (h[i][it] * 1ll * p[it] + s[i]) % mod[it];
			pw[i + 1][it] = (pw[i][it] * 1ll * p[it]) % mod[it];
		}
	}
	
	long long ans = 0, ans1 = 0;
	for(int i = 1; i <= n; i++){
		int s[2] = {};
		
		for(int j = i; j <= n; j++){
			ans += cnt[j - i + 1][get(i, j)];
			ans += cnt1[j - i + 1][get(i, j)];
			for(int k = i; k <= j; k++){
   				int len = k - i + 1;
   				if(get(i, i + len - 1) == get(j - len + 1, j)){
   					if(i + len <= j - len)
   						ans += cnt[j - len - i - len + 1][get(i + len, j - len)];	
   				}
			}
		}

		for(int j = 1; j <= i; j++){			
			for(int k = j; k <= i; k++){
				int len = k - j + 1;
				if(get(j, j + len - 1) == get(i - len + 1, i)){
					if(j + len <= i - len)
						cnt1[i - len - j - len + 1][get(j + len, i - len)]++;	
				}
			}
			cnt[i - j + 1][get(j, i)]++;
		}
	}
	
	
	cout << ans  << "\n";
}