#include <bits/stdc++.h>
int main() {
  char s[51];
  scanf("%s", s);
  int n = strlen(s);
  int seen[51];
  int i, j, k;
  for (i = 0; i < n; i++) {
    seen[i] = 0;
  }
  int count = 0;
  for (i = 0; i < n; i++) {
    if (!seen[i]) {
      count++;
      for (j = i + 1; j < n; j++) {
        k = n;
        int all_same = 1;
        int ti = i;
        int tj = j;
        while (k--) {
          ti = ti % n;
          tj = tj % n;
          if (s[ti] == s[tj]) {
            ti++;
            tj++;
          } else {
            all_same = 0;
            break;
          }
        }
        if (all_same) {
          seen[j] = 1;
        }
      }
    }
  }
  printf("%d\n", count);
  return 0;
}
