#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<60;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int main() {
	string s;
	cin >> s;
	
	set<string> ss;
	
	queue<pair<string, string> > que;
	
	que.push(make_pair(s, (string)""));
	
	while (!que.empty()) {
		string now = que.front().first;
		string ad = que.front().second;
		
		que.pop();
		
		if (now == "") {
			ss.insert(ad);
			continue;
		}
		
		que.push(make_pair(now.substr(1), ad + now[0]));
		que.push(make_pair(now.substr(0, now.size() - 1), ad + now[now.size() - 1]));
	}
	
	cout << ss.size() << endl;
	
	return 0;
}