//ALEXANDRU MICLEA

#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cstring>
#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>
#include <random>
#include <chrono>
#include <assert.h>

using namespace std;
using ll = long long;

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


//VARIABLES



//FUNCTIONS

ll manacher(string s) {
    ll n = s.size();
    ll ans = 0;
    vector <ll> d1(n);
    vector <ll> d2(n);

    for (ll i = 0, l = 0, r = -1; i < n; i++) {
        ll k = (i > r) ? 1 : min(d1[l + r - i], r - i + 1);
        while (0 <= i - k && i + k < n && s[i - k] == s[i + k]) k++;
        d1[i] = k--;
        if (i + k > r) l = i - k, r = i + k;

        ans += d1[i] / 2;
    }

    return ans;
}

//MAIN

int main() {

    string s1; cin >> s1;
    string s = "#";

    for (auto& x : s1) {
        s += x;
        s += "#";
    }
    
    cout << manacher(s);
    
    return 0;
}