#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

set<string> g;
int N;

void dfs (int depth, string curr, string cand ){

	if (depth == N ){
//		cerr << "cand: " << cand << endl;
		g.insert (cand );
		return;
	} // end if

	string next1 = cand, next2 = cand;
	next1 += curr[0];
	dfs (depth + 1, curr.substr(1), next1  );

	next2 += curr[curr.length() - 1];
	dfs (depth + 1, curr.substr(0, curr.length() - 1 ) , next2 );

}

int main()
{
	ios_base::sync_with_stdio(0);
	string S; cin >> S; N = S.length();

	g.clear();
	dfs (0, S, "" );

	cout << g.size() << endl;

	return 0;
}