//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

int manacher(string s, int n) {
    vector <int> d1(n);
    vector <int> d2(n);

    for (int i = 1, l = 0, r = -1; i < n; i++) {
        int 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;
    }

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

    int ans = 0;

    d1[0] = 1;
    for (int i = 0; i < n; i++) {
        //cout << d1[i] << ' ' << d2[i] << '\n';
        ans += d1[i];
        ans += d2[i];
    }



    return ans;
}

//MAIN

int main() {

    string s; cin >> s;
    int n = s.length();
    
    cout << manacher(s, n);
    
    return 0;
}