#include <cassert>
#include <cstdio>
#include <cstring>

#include <algorithm>
using namespace std;

typedef long long int64;

const int MAX_N = 1000005;

int n;
char v[2 * MAX_N];
int d[2 * MAX_N];

void read() {
    assert(freopen("pscpld.in", "r", stdin));
    assert(freopen("pscpld.out", "w", stdout));

    scanf("%s", v + 1);
    n = strlen(v + 1);

    for (int i = 2 * n + 1; i > 0; --i)
        if ((i % 2) == 1)
            v[i] = '#';
        else
            v[i] = v[i / 2];
    n = 2 * n + 1;
}

void solve() {
    int best = 0;
    for (int i = 1; i <= n; ++i) {
        if (best + d[best] >= i)
            d[i] = min(best + d[best] - i, d[2 * best - i]);
        while (i - d[i] - 1 > 0 && i + d[i] + 1 <= n &&
               v[i - d[i] - 1] == v[i + d[i] + 1])
            ++d[i];
        if (i + d[i] >= best + d[best])
            best = i;
    }

    int64 sol = 0;
    for (int i = 1; i <= n; ++i)
        if ((i % 2) == 1)
            sol += d[i] / 2;
        else
            sol += (d[i] + 1) / 2;
    printf("%lld\n", sol);
}

int main() {
    read();
    solve();
}