#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
#define INF 1e9
#define PI acos(-1)
typedef long long ll;

string str;
set<string> cnt;

int dfs(int n, string x, string rest) {
	if (n == 0) {
		if (cnt.count(x) == 0) {
			cnt.insert(x);
			return 1;
		}
		else return 0;
	}
	int ans = 0;
	ans += dfs(n - 1, x + rest[0], rest.substr(1, n - 1));
	ans += dfs(n - 1, x + rest[n - 1], rest.substr(0, n - 1));
	return ans;
}

int main() {
	cin >> str;
	int n = str.size();
	cout << dfs(n, "", str) << endl;
	return 0;
}