#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <ctime>
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FFOR(i,a,b) for(int i=(a);i<=(b);i++)
#define REP(i,b) FOR(i,0,b)
#define RREP(i,b) FFOR(i,1,b)
#define PB push_back
#define F first
//#define S second
#define BE(c) c.begin(),c.end()
using namespace std;
typedef long long LL;
typedef LL ut;
typedef long double ld;
typedef pair<ut,ut> pr;
typedef vector<pr> Vpr;
typedef vector<ut> VI;
typedef pair<ut,pr> ppr;
typedef priority_queue<pr,Vpr, greater<pr> > PQ;
const int SIZE=1e+5 + 1;
const ut INF=1<<29;
const ld eps=1e-6;
const LL mod=1e+6 + 3;

map<string, bool> check;
int N;
string S;

int dfs(string s, string t){
	if(t.size() == N){
		//cout << t << endl;
		if(!check[t]){
			check[t] = true;
			return 1;
		}
		else
			return 0;
	}
	int res = 0;
	res += dfs(s.substr(1, s.size() - 1), t + s[0]);
	res += dfs(s.substr(0, s.size() - 1), t + s[s.size() - 1]);
	return res;
}

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