#include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#define REP(i,n) for(int i=0;i<n;i++)
typedef long long ll;

using namespace std;
int kaijo(int n){
	int ans = 1;
	if (n != 0){
		for (int i = 0; i < n; i++){
			ans *= (n - i);
		}
	}
	else{
		ans = 1;
	}
	return ans;
}

int main(){
	string s;
	string a[10000];
	string d1, d2;
	int size;
	int flag;
	int cnt = 0;
	cin >> s;
	size = s.size();
	int x = 0;
	int n = 0;
	//cout << size << endl;
	while (1){
		x++;
		d1 = s.substr(0, x);
		d2 = s.substr(size-x, x);


		if (d1 == d2){
			//cout << "TRUE"<< endl;
			a[n] = d1;
			s.erase(0, x);
			REP(i, x){
				s.pop_back();
			}
			//cout << s << endl;
			size = s.size();
			x = 0;
			n++;
		}
		if (size == 0){
			flag = 0;
			break;
		}else if (x == size / 2){
			a[n] = s;
			n++;
			flag = 1;
			break;
		}

		


	}
	//cout << n << endl;
	d1 = "";
	d2 = "";
/*	REP(i, n){
		cout << a[i] << endl;
	}*/
	if (flag == 1){
		cnt = n;
		for (int j = 2; j < n; j++){
			REP(i, n - j+1){
				REP(k, j){
					d1 = d1 + a[i+k];
					d2 = a[i+k] + d2;
					//cout << d1 << " " << d2 << endl;
				}
				if (d1 == d2){
					cnt += n - i - j;
				}
				d1 = "";
				d2 = "";
			}
		}


	}
	cout << cnt << endl;
	return 0;
}