#include <iostream>
#include <string>
#include <set>
using namespace std;

string s;
int sfi, sri;

set<string> m;
char ts[10];
int tsi;

void dfs(int d)
{
	d > 0 ? ts[tsi++] = s[sfi++] : ts[tsi++] = s[sri--];

	if ( tsi >= s.length() ) {
		m.insert(ts);
	}
	else {
		dfs(1);
		dfs(-1);
	}

	d > 0 ? sfi-- : sri++;
	tsi--;
}

int main()
{
	cin >> s;
	sfi = 0;
	sri = (int)s.length() - 1;

	dfs(1);
	dfs(-1);

	cout << m.size() << endl;

	return 0;
}