#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

set<string>st;

void dfs(string s,string t) {
	if (s.size() == 0) {
		st.insert(t);
		return;
	}
	string temp1 = "";
	string temp2 = "";
	rep(i, 0,s.size()-1) {
		temp1 += s[i];
		temp2 += s[s.size() - i-1];
	}
	dfs(temp1, t + s[s.size() - 1]);
	dfs(temp2, t + s[0]);
}

int main() {
	string s;
	cin >> s;

	dfs(s, "");
	cout << st.size() << endl;
	return 0;
}