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

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

string s;
set<string> st;
int main(){
    cin>>s;
    int N=s.size();
    REP(mask,0,(1<<N)){
        string str;
        int l=0, r=N-1;
        REP(j,0,N){
            if(mask&1<<j) {
                str+=s[l];
                l++;
            }else{
                str+=s[r];
                r--;
            }
        }
        st.insert(str);
    }
    p(st.size());
    return 0;
}