#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#include<set>
 
using namespace std;
 
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define pb push_back
 
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef long long ll;

set<string> m;

void dfs(string a,string b){
	if(a.length()>0){
		dfs(a.substr(1),b+a.front()); //先頭除いてbに付ける
		dfs(a.substr(0,a.length()-1),b+a.back()); //後ろ除いてbに付ける
	}
	else
		m.insert(b);
}

int main(){
	string S;
	cin>>S;
	dfs(S,"");
	cout<<m.size()<<endl;
	return 0;
}