#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define rep(i,x,y) for(register int i=x;i<=y;i++)
#define rep1(i,x,y) for(register int i=x;i>=y;--i)
#define int long long
#define fire signed
#define il inline
template<class T> il void print(T x) {
	if(x<0) printf("-"),x=-x;
	if (x > 9) print(x / 10);
	putchar(x % 10 + '0');
}
template<class T> il void in(T &x) {
    x = 0; char ch = getchar();
    int f = 1;
    while (ch < '0' || ch > '9') {if(ch=='-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); }
    x *= f;
}
int T=1;
string s;
int n;
const int N=1e3+10,M=1e6+10;
const int ba=131,mod=998244853;
int ha[N],jc[N];
gp_hash_table<int,int>mp[N];
int has(int l,int r) {
	return ((ha[r]-(ha[l-1]*jc[r-l+1]))%mod+mod)%mod;
}
void solve() {
	cin>>s;
	string t=s;
	int res=0;
	s=" "+s;
	n=s.size()-1;
	rep(i,1,n) ha[i]=(ha[i-1]*ba%mod+(s[i]-'a'+1))%mod;
	rep1(r,n,1) {
		rep(l,1,r) {
			int len1=r-l+1;
			rep(len,len1+1,min(n,2*len1)) {
				if(len&1) continue;
				int le=len/2,yu=r-l+1-le;
				if(yu&&has(l,l+yu-1)!=has(le+l,r)) continue;
				res+=mp[len-len1][has(l+yu,l+le-1)];
			}
		}
		rep(rr,r,n) {
			mp[rr-r+1][has(r,rr)]++;
		}
	}
//	return;
	reverse(t.begin(),t.end());
	t=" "+t;
	s=t;
	rep(i,1,n) mp[i].clear();
	rep(i,1,n) ha[i]=(ha[i-1]*ba%mod+(s[i]-'a'+1))%mod;
	rep1(r,n,1) {
		rep(l,1,r) {
			int len1=r-l+1;
			rep(len,len1+1,min(n,2*len1-1)) {
				if(len&1) continue;
				int le=len/2,yu=r-l+1-le;
				if(yu&&has(l,l+yu-1)!=has(le+l,r)) continue;
				res+=mp[len-len1][has(l+yu,l+le-1)];
			}
		}
		rep(rr,r,n) mp[rr-r+1][has(r,rr)]++;
	}
	rep(i,1,n) mp[i].clear();
	printf("%lld\n",res);
}
fire main() {
//	freopen("string.in","r",stdin);
//	freopen("string.out","w",stdout);
	T=1; 
//	in(T); 
	jc[0]=1;
	rep(j,1,1000) jc[j]=jc[j-1]*ba%mod;
	while(T--) {
		solve();
	}
	return false;
}