//ALEX ENACHE

#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;

//#include <iostream>
#include <fstream>
ifstream cin ("pscpld.in");ofstream cout ("pscpld.out");

int pali[1000100];

int main() {

    //freopen("input", "r", stdin);freopen("output", "w", stdout);

    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

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

    int last = 0;
    long long ans = 0;

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

    cout<<ans;

    return 0;
}