#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

int main() {
  string s;
  cin >> s;

  string t;
  set<string> st;
  auto f = [&](auto &f, string s) -> void {
    if (sz(s) == 0) {
      st.insert(t);
      return;
    }
    {
      t += s[0];
      f(f, s.substr(1));
      t.pop_back();
    }
    {
      t += s.back();
      f(f, s.substr(0, sz(s) - 1));
      t.pop_back();
    }
  };
  f(f, s);
  cout << sz(st) << endl;
  return 0;
}