#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;
map<string, bool> MAP;
void dfs (string s, string ans) {
  if(s.length() == 0) {
    MAP[ans] = true;
    return;
  }
  char a = s[0];
  char b = s[s.length()-1];
  string nexta = ans + a;
  string nextb = ans + b;
  dfs(s.substr(1),nexta);
  dfs(s.substr(0,s.length()-1),nextb);
  return;
}

int main(){
  string s;
  cin >> s;
  dfs(s,"");
  cout << MAP.size() << endl;
  return 0;
}