#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const int N=4e5+5;
int n;
string s,t;
int rnk[400005];
pair<ll,int>funny[400005];
array<vector<int>,2>manacher(string s){
	array<vector<int>,2>p;p[0].resize(n+1);p[1].resize(n);
	for(int z=0; z<2 ;z++){
		for(int i=0,l=0,r=0; i<n ;i++){
			int t=r-i+!z;
			if(i<r) p[z][i]=min(t,p[z][l+t]);
			int L=i-p[z][i],R=i+p[z][i]-!z;
			while(L>=1 && R+1<n && s[L-1]==s[R+1]){
				p[z][i]++,L--,R++;
			}
			if(R>r) l=L,r=R;
		}
	}
	return p;
}
int bit[N];
void upd(int id){
	for(int i=id; i<=n ;i+=i&-i) bit[i]++;
}
int qry(int id){
	int res=0;
	for(int i=id; i>=1 ;i-=i&-i) res+=bit[i];
	return res;
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	cin >> s;n=s.size();
	if(n==1) return cout << "0\n",0;
	t=s;reverse(t.begin(),t.end());t=s+t;
	t='?'+t;
	//cout << s << ' ' << t << endl;
	{//suffix array
		for(int i=1; i<=2*n ;i++) rnk[i]=t[i];
		for(int i=1; (1<<i)<4*n ;i++){
			ll mg=1e9;
			for(int j=1; j<=2*n ;j++){
				if(j+(1<<(i-1))>2*n) funny[j]={rnk[j]*mg,j};
				else funny[j]={rnk[j]*mg+rnk[j+(1<<(i-1))],j};
			}
			sort(funny+1,funny+2*n+1);
			int ptr=1;
			for(int j=1; j<=2*n ;j++){
				if(j==1 || funny[j].fi!=funny[j-1].fi) ptr=j;
				rnk[funny[j].se]=ptr;
			}
		}
	}
	auto p=manacher(s);
	for(int i=1; i<=2*n ;i++){
		funny[i]={rnk[i],i};
	}
	sort(funny+1,funny+2*n+1);
	ll ans=0;
	for(int i=2*n; i>=1 ;i--){
		int x=funny[i].se;
		//cout << "haha " << x << ' ';
		if(x>n) ans+=qry(2*n+1-x);
		else upd(x);
		//cout << ans << endl;
	}
	int cnt=0;/*
	for(int i=1; i<=n ;i++){
		for(int j=i; j<=n ;j++){
			if(rnk[i]>rnk[2*n+1-j]){
				cout << "! " << (++cnt) << ' ' << i << ' ' << j << endl;
			}
		}
	}*/
	{//deal with even false alarms
		for(int i=1; i<=n-1; i++){
			int ban=p[0][i];
			if(rnk[i+1]>rnk[2*n+1-i]){//prefix>suffix
				ans-=ban;
			}
		}
		for(int i=1; i<=n ;i++){
			int ban=p[1][i-1]+1;
			if(rnk[i]>rnk[2*n+1-i]){
				ans-=ban;
			}
		}
	}
	cout << ans << '\n';
}