#include <iostream>
#include <vector>
#include <utility>
#include <set>
#include <list>

using namespace std;
using ll = long long int;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)

#define ALL_INCLUDED_ENVIRONMENT

template <class T> std::ostream& operator<<(std::ostream& o, const std::vector<T>& v) {
  o << "{";
  for (int i = 0; i < (int) v.size(); i++)
    o << (i > 0 ? ", " : "" ) << v[i];
  o << "}";
  return o;
}

template <class T> std::ostream& operator<<(std::ostream& o, const std::list<T>& lst) {
  o << "{";
  for (auto itr = lst.begin(); itr != lst.end(); itr++)
    o << (itr == lst.begin() ? "" : ", " ) << *itr;
  o << "}";
  return o;
}

template <class X, class Y> std::ostream& operator<<(std::ostream& o, const std::pair<X, Y>& p) {
  o << "(" << p.first << ", " << p.second << ")";
  return o;
}

int main() {
  // cin.tie(0);
  // ios::sync_with_stdio(false);
  string s;
  cin >> s;
  set<string> table;
  
  int n = s.size();
  string key(n, ' ');
  REP(bits, 1 << n) {
    string::iterator l = s.begin();
    string::iterator r = s.end(); r--;
    REP(i, n) {
      if (bits & (1 << i)) {
        key[i] = *l;
        l++;
      } else {
        key[i] = *r;
        r--;
      }
    }
    // cout << lst << "\n";
    table.insert(key);
  }
  cout << table.size() << "\n";
  return 0;
}