#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
string s;
int pf[801];
int lcp[801][801];
int solve(){
	for(int i=1; i<=n ;i++){
		for(int j=1; j<i ;j++){
			int z=0;
			while(i+z<=n && s[i+z]==s[j+z]) z++;
			lcp[i][j]=lcp[j][i]=z;
		}
	}
	ll ans=0;
	for(int i=1; i<=n ;i++){
		for(int j=1; j<=i ;j++){
			int sl=i-j+1;
			for(int k=1; k<=j ;k++){
				int cur=0;
				if(k>=sl && lcp[k-sl+1][j]>=sl) cur=1;
				pf[k]=pf[k-1]+cur;
			}
			for(int k=j; k>=1 ;k--){
				int tl=j-k;
				if(tl>0){
					if(i>n || lcp[k][i+1]<tl) continue;//T doesnt match
				}
				ans+=pf[k-1]*(1+(tl!=0));
			}
		}
	}
	return ans;
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	cin >> s;n=s.size();s='?'+s;
	ll ans=solve();
	reverse(s.begin()+1,s.end());
	ans+=solve();
	ans/=2;
	cout << ans << '\n';
}