#include <bits/stdc++.h>
#include <random>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef vector<int> vi; 
typedef vector<pi> vpi;

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
#define bk back()
#define pb push_back

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define For(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define Rof(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7;
const ld PI = acos((ld)-1);
mt19937 rng; // or mt19937_64
template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }

void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << h; if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); 
	string S;cin>>S;
	int n = sz(S);

	vector<vi> lcp(n, vi(n));
	for(int i=n-1;i>=0;i--) {
		for(int j=n-1;j>=0;j--) {
			if(S[i]==S[j]) {
				lcp[i][j] = (i==n-1 || j==n-1)?1:1+lcp[i+1][j+1];
			} else {
				lcp[i][j] =0;
			}
		}
	}

	ll ans1 = 0;
	For(i,n)FOR(j,i+1,n) {
		int mxLen = j-i;
		dbg(i,j,min(mxLen,lcp[i][j]));
		ans1 += min(mxLen, lcp[i][j]);
	}
	dbg(ans1);

	ll ans2 = 0;

	auto solve = [&](int n, vector<vi> lcp) {
		For(a,n)FOR(b,a,n) {
			int cur = 0;
			FOR(c,b+1,n) {
				if(c>=b+2 && lcp[a][c] >= b-a+1) {
					ans2 += cur;
				}

				int aLen = c-b;
				int stInd = a-aLen;
				if(stInd>=0 && lcp[stInd][b+1]>=aLen) {
					cur++;
				}
			}
		}
	};
	
	solve(n,lcp);

	reverse(all(S));
	for(int i=n-1;i>=0;i--) {
		for(int j=n-1;j>=0;j--) {
			if(S[i]==S[j]) {
				lcp[i][j] = (i==n-1 || j==n-1)?1:1+lcp[i+1][j+1];
			} else {
				lcp[i][j] =0;
			}
		}
	}

	solve(n,lcp);

	cout << ans1 + ans2 << endl;
}


/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
*/