#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<ctime>
#include<cstdlib>
#include<numeric>
#include <typeinfo>
using namespace std;
typedef long long ll;
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define rloop(i,a,b) for(int i=a;i>=b;i--)
const int inf=1e8;
const ll INF=1e16;
#define MOD 1000000007
#define mod 1000000009
#define m 1000003

void solve(vector<string> *all,string *s1,string *s2){
	string s12,s22;
	s12=*s1;s22=*s2;
	if(s1->size()!=1){
		char last=s1->back();
		s1->pop_back();
		s2->push_back(last);
		solve(all,s1,s2);
		char first=s12.front();
		s12.erase(s12.begin());
		s22.push_back(first);
		solve(all,&s12,&s22);
	}else{
		*s2+=*s1;
		all->push_back(*s2);
	}
}
int main(){
	string s1;
	cin>>s1;
	string s2;
	vector<string> all;
	solve(&all,&s1,&s2);
	sort(all.begin(),all.end());
	string temp=all[0];
	int cnt=1;
	loop(i,1,all.size()){
		if(temp!=all[i]){
			cnt++;
			temp=all[i];
		}
	}
	cout<<cnt<<"\n";
}