// Too many mind, no mind.
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <iomanip>

using namespace std;

#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define COMP(x) sort(ALL(x)); x.resize(unique(ALL(x)) - (x).begin())
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)

using pii = pair <int, int>;
using vi = vector <int>;
using vpi = vector <pii>;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using ld = long double;
using vld = vector<ld>;

const int maxn = 810;
int n;
char a[maxn];
int lcs[maxn][maxn];
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin >> a;
	n = strlen(a);
	forn(i, n) fore(j, i, n-1) {
		int k=0;
		while (i + k < j && j + k < n && a[j+k] == a[i+k]) k++;
		lcs[i][j] = k;
	}

	ll ans = 0;
	forn(i, n) fore(j, i, n-1) {
		fore(k, j+1, n-1) ans += lcs[i][k] >= j-i + 1;
	}

	forn(i, n) fore(j, i, n-1) {
		for (int c=0, k=n-1, l=0; c<i; c++) {
			int len  = i-c;
			if (lcs[c][j+1] < len) continue;
			while (k>j+len) {
				if (lcs[i][k] >= j-i+1) ans++;
				k--;
			}
			while (l<i-len) {
				if (lcs[l][i] >= j-i+1) ans++;
				l++;
			}
		}
	}

	cout << ans << endl;
	return 0;
}