#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
signed main(){
  string S;cin>>S;ll N=S.size();vector<string>ans;
  REP(i,1<<N){
    string T;ll l=0,r=N-1;
    REP(j,N){if((i>>j)&1)T+=S[l++];else T+=S[r--];}
    ans.push_back(T);
  }
  sort(ALL(ans));ll k=0;
  REP(i,ans.size())if(i==0||ans[i]!=ans[i-1])k++;cout<<k<<endl;
  return 0;
}