#include <iostream>
#include <algorithm>
#include <set>
using namespace std;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

int main(void) {
  string s; cin >> s;
  int n = s.size();
  set<string> sett;
  for(int S : range(1<<n)) {
    string t;
    int p = 0, q = n-1;
    for(int i : range(n)) {
      if(S >> i & 1) { t += s[p++]; }
      else { t += s[q--]; }
    }
    sett.insert(t);
  }
  int res = sett.size();
  printf("%d\n", res);
  return 0;
}