#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <sstream>
#include <string>
#include <vector>

using namespace std;


/*
int fibbi(int n)
{
  if (n <= 0)
    return 0;

  if (n == 1)
    return 0;

  if (n == 2)
    return 1;

  if (n == 3)
    return 1;

  if (n == 4)
    return 2;

  vector<long long int> vec(n + 1, 0);
  vec[0] = 0;
  vec[1] = 0;
  vec[2] = 1;
  vec[3] = 1;
  vec[4] = 2;

  for (auto i = 5; i < n + 1; i++)
    vec[i] = 1 + min(min(vec[i / 3] + i % 3, vec[i / 2] + i % 2), vec[i - 1]);

  return vec[n];
}
*/


int main() {

    int n, l = 0, r = -1, k = 0;
	long long answ = 0;
	string s;
    getline(cin, s);
	n = s.size();
	vector<int> vec(n + 1);

	for (int i = 0; i < n; ++i) {

        if (i > r)
            k = 1;
        else
            k = min(vec[l + r - i], r - i + 1);
		while (i + k < n & i - k >= 0 & s[i + k] == s[i - k])
            ++k;

		vec[i] = k;

		if (i + k - 1 > r)
			l = i - k + 1, r = i + k - 1;

	}

	vector<int> vec1(n);
	l = 0;
    r = -1;

	for (int i = 0; i != n; ++i) {

        if (i > r)
            k = 0;
        else
            k = min(vec1[l + r - i + 1], r - i + 1);
		while (i + k < n & i - k - 1 >= 0 & s[i + k] == s[i - k - 1])
            ++k;

		vec1[i] = k;

		if (i + k - 1 > r)
			l = i - k, r = i + k - 1;

	}

	for (int i = 0; i != n; i++) {

		answ += vec[i] + vec1[i];

	}

	cout << answ;

	return 0;
}