#include <iostream>
#include <cstring>
#include <algorithm>
#include <limits.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
/* ここからが本編 */
/*  */

int int_pow(int x,int n) {
   int res = 1;
   while(n > 0) {
      if(n&1) res = res * x;
      x = x * x;
      n >>= 1;
   }
   return res;
}
int main(void)
{
  int test = 1;
  int i,j,k,l;
  static char s[550][12] = {};
  int a = 1,b,c;
  int n,m;
  cin >> s[0];
  n = strlen(s[0]);
  m = int_pow(2,strlen(s[0])-1);
  for(i=0;i<m;i++) {    
    char tmp[12] = {};
    int start = 0,end = n-1;
    b = i;
    c = 0;
    while(start < end) {
      if(b%2) tmp[c++] = s[0][start++];
      else tmp[c++] = s[0][end--];
      b >>= 1;
    }
    tmp[c] = s[0][start];
    for(j=1;j<a;j++) {
      if(strcmp(s[j],tmp) == 0) break;
    }
    if(j == a) {
      strcpy(s[a++],tmp);
    }
  }
  printf("%d\n",a-1);
  return 0;
}