#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  string s;
  cin >> s;
  int n = s.size();
  set<string> st;
  for (int bit = 0; bit < (1 << n); ++bit) {
    deque<char> que;
    for (int i = 0; i < n; ++i) {
      que.push_back(s[i]);
    }
    string res = "";
    for (int i = 0; i < n; ++i) {
      if (bit >> i & 1) {
        res += que.front();
        que.pop_front();
      } else {
        res += que.back();
        que.pop_back();
      }
    }
    st.insert(res);
  }
  cout << st.size() << endl;
  return 0;
}