#include "bits/stdc++.h"
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define revrep(i, a, n) for (int i = n; i >= a; --i)
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
using namespace std;

string to_string(const string &s) { return '"' + s + '"'; }
template<class A> string to_string(A v) {
	bool first = 1;
	string res = "{";
	for (const auto &x: v) {
		if (!first) res += ", ";
		first = 0;
		res += to_string(x);
	}
	res += "}";
	return res;
}
void debug_out() { cerr << endl; }
template<class H, class... T> void debug_out(H h, T... t) {
	cerr << " " << to_string(h);
	debug_out(t...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

using vi = vector<int>;
using ll = long long;
using pii = pair<int, int>;

struct SA {
	int n;
	vi str, sa, rank, h;

	template<class T> SA(const T &s): n(sz(s)), str(n + 1), sa(n + 1), rank(n + 1), h(n - 1) {
		auto vec = s;
		sort(all(vec)); vec.erase(unique(all(vec)), vec.end());
		rep(i, 0, n - 1) str[i] = rank[i] = lower_bound(all(vec), s[i]) - vec.begin() + 1;
		iota(all(sa), 0);
		n++;

		for (int len = 0; len < n; len = len ? len * 2 : 1) {
			vi cnt(n + 1);
			for (auto v: rank) cnt[v + 1]++;
			rep(i, 1, n - 1) cnt[i] += cnt[i - 1];

			vi nsa(n), nrank(n);

			for (auto pos: sa) {
				pos -= len;
				if (pos < 0) pos += n;
				nsa[cnt[rank[pos]]++] = pos;
			}
			swap(sa, nsa);

			int r = 0, oldp = -1;
			for (auto p: sa) {
				auto next = [&](int a, int b) { return a + b < n ? a + b : a + b - n; };
				if (~oldp) r += (rank[p] != rank[oldp]) || (rank[next(p, len)] != rank[next(oldp, len)]);
				nrank[p] = r;
				oldp = p;
			}
			swap(rank, nrank);
		}
		sa = vi(sa.begin() + 1, sa.end());
		rank.resize(--n);
		rep(i, 0, n - 1) rank[sa[i]] = i;


		int len = 0;
		rep(i, 0, n - 1) {
			if (len) len--;
			int rk = rank[i];
			if (rk == n - 1) continue;
			while (str[i + len] == str[sa[rk + 1] + len]) len++;
			h[rk] = len;
		}
	}
};

template<class T>
vi Manacher(const T &s) {
	int n = sz(s);
	vi len(n * 2 - 1, 1);
	int j = 0;
    rep(i, 1, n * 2 - 2) {
        int p = i / 2, q = i - p, r = (j + 1) / 2 + len[j] - 1;
        len[i] = r < q ? 0 : min(r - q + 1, len[j * 2 - i]);
        while (p > len[i] - 1 && q + len[i] < n && s[p - len[i]] == s[q + len[i]]) len[i]++;
        if (q + len[i] - 1 > r) j = i;
    }
	return len;
}

template<class T>
struct BIT {
	int n;
	vector<T> as;
	BIT(int n): n(n), as(n + 1) {}
	void Add(int i, T val) {
		for (i++; i <= n; i += i & -i) as[i] += val;
	}
	T ask(int i) {
		T res{};
		for (i++; i; i -= i & -i) res += as[i];
		return res;
	}
};


int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	
	string s; cin >> s;
	int n = sz(s);
	string S = s;
	S += char(127);
	reverse(all(s));
	S += s;
	reverse(all(s));
	s.push_back(127);
	SA suf(S);
	auto &rank = suf.rank;
	BIT<int> bit(n * 2 + 1);
	ll ans = 0;
	revrep(i, 0, n - 1) {
		int pos = rank[i];
		int pos2 = rank[n * 2 - i];
		bit.Add(pos2, 1);
		ans += bit.ask(pos);
	}
	auto rads = Manacher(s);
	rep(i, 0, n - 1) {
		int r = rads[i * 2];
		int ed = s[i + r];
		int st = i - r < 0 ? -1 : s[i - r];
		if (st < ed) ans -= r;
	}
	rep(i, 0, n - 2) {
		int r = rads[i * 2 + 1];
		if (r == 0) continue;
		int ed = s[i + 1 + r];
		int st = i - r < 0 ? -1 : s[i - r];
		if (st < ed) ans -= r;
	}
	printf("%lld\n", ans);
	return 0;
}