#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
#include <stack>

using namespace std;

set<string> ss;
string s;

void solve(){
	int n=ss.size();
	for(int i=0;i<s.size()-1;i++){
		swap(s[i],s[i+1]);
		ss.insert(s);
		if(ss.size()!=n) solve();
	}
}

int main()
{
	cin>>s;

	if(s.size()==1){cout<<0<<endl; return 0;}

	solve();
	cout<<ss.size()-1<<endl;

	return 0;
}