//#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>

using namespace std;
int main() {

	

	string cit, s;
	cin >> cit;
	s += '!';
	s += '#';
	for (auto& x : cit) {
		s += x;
		s += '#';
	}
	s += '?';

	int ultim= 0;
	long long ans = 0;

	for (int i = 1; i < s.size() - 1; i++) {
		int opus = ultim- (i - ultim);
		if (ultim+ pali[ultim] >= i) {
			pali[i] = min(pali[opus], ultim+ pali[ultim] - i);
		}
		while (s[i + pali[i] + 1] == s[i - pali[i] - 1]) {
			pali[i] ++;
		}
		if (i + pali[i] > ultim+ pali[ultim]) {
			ultim= i;
		}
		
		ans += 1LL * (pali[i] / 2 + pali[i] % 2);
	}

	cout << ans;

	return 0;
}