#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define EXIST(v, n) (std::find(v.begin(), v.end(), 1) != v.end())

using namespace std;

set<string> string_set;
string s1, s2;
int size;
void generate_str(int i, int j, string s) {
	if (i + j == size) {
		string_set.insert(s);
		return;
	}
	generate_str(i + 1, j, s + s1[i]);
	generate_str(i, j + 1, s + s2[j]);
}

int main(int argc, char *argv[]) {
	cin >> s1;
	size = s1.size();

	s2 = s1;
	reverse(ALL(s2));
	generate_str(0, 0, "");
	cout << string_set.size() << endl;
}