#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <set>

using namespace std;

int main() {
	string s, newstr;

	cin >> s;
	int n = s.size();
	newstr = s;
	set<string> words;

	for (int i = (1 << (n - 1)) - 1; i >= 0; i--) {
		int front = 0;
		int rear = n - 1;
		for (int j = 0; j < n; j++) {
			if ((i >> j) & 1) {
				newstr[j] = s[front];
				front++;
			} else {
				newstr[j] = s[rear];
				rear--;
			}
		}
		newstr[n - 1] = s[front];
		words.insert(newstr);
	}
	cout << words.size() << endl;
	return 0;
}