#include <bits/stdc++.h>
using namespace std;
int main() {
  string s;
  cin >> s;
  if (s.size() == 1) {
    cout << 1 << endl;
    return 0;
  }
  map<string, int> p;
  int counter = 1;
  p[s]++;
  string o;
  o += s[s.size() - 1];
  o += s.substr(0, s.size() - 1);
  if (p[o] > 0)
    ;
  else {
    p[o]++;
    counter++;
  }
  int n = s.size();
  n -= 2;
  while (n--) {
    string x;
    x += o[o.size() - 1];
    x += o.substr(0, o.size() - 1);
    if (p[x] > 0)
      ;
    else {
      p[x]++;
      counter++;
    }
    o = x;
  }
  cout << counter << endl;
  return 0;
}
