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

typedef long long ll;
using namespace std;

#define mod 1000003
#define INF 10000000
#define LLINF 2000000000000000000LL

#define SIZE 10000

vector<string> ans;

void dfs(string S,string create){
    string S1,S2;
    
    if(S.empty()){
        ans.push_back(create);
        return;
    }
    
    for(int i=0;i<S.size();i++){
        if(i!=S.size()-1) S1+=S[i];
        if(i!=0) S2+=S[i];
    }
    
    dfs(S1,create+S[S.size()-1]);
    dfs(S2,create+S[0]);
    
}

int main(){
    string in;
    
    cin >> in;
    
    dfs(in,"");
    
    sort(ans.begin(),ans.end());
    ans.erase(unique(ans.begin(),ans.end()),ans.end());
    
    cout << ans.size() << endl;
    
    return 0;
}