#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i,a) for(auto &i:a)

typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 2147483647;
const ll INFL = 9223372036854775807;
const ll mod = 1000000007;





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

	VS a;

	REP(i, (1 << s.size())) {
		string t = s, u = "";
		REP(j, s.size()) {
			if (i&(1 << j)) {
				u += t[0];
				t.erase(0, 1);
			}
			else {
				u += t[t.size() - 1];
				t.erase(t.size() - 1, 1);
			}
		}
		a.push_back(u);
	}

	sort(ALL(a));

	int ans = 1;

	REP(i, a.size()-1) {
		if (a[i + 1] == a[i])continue;
		else ans++;
	}

	cout << ans << endl;
	   	 
	return 0;
}