#include <iostream>
#include <vector>
#include <cmath>
#include <string>
using namespace std;
using ll = unsigned long long;
ll B = pow(10, 9) + 7;
vector<ll> overlap(string s) {
	ll n = s.size(), BM = 1;
	ll shash = 0, thash = 0;
	vector<ll> ans;
	for (ll len = 1; len <= n; len++) {
		if (len - 1 >= n - len) break;
		shash = shash * B + s[len-1];
		thash = s[n-len] * BM + thash;
		if (shash == thash)  ans.push_back(len);
		BM *= B;
	}
	return ans;
}
void solve(const string& s, ll& ans) {
	vector<ll> vec = overlap(s);
	ll n = s.size();
	for (auto len: vec) {
		string ns = s.substr(len, n-2*len);
		ans++;
		solve(ns, ans);
	}
}
int main() {
	string s; cin >> s;
	ll ans = 1;
	solve(s, ans);
	cout << ans << endl;
}