#include <bits/stdc++.h>
using namespace std;
void solve() {
  string s, a = "", b;
  cin >> s;
  unordered_map<string, int> m;
  m[s]++;
  for (int i = s.length() - 1; i >= 0; i--) {
    a += s[i];
    b = a;
    reverse(b.begin(), b.end());
    m[b + s.substr(0, i)]++;
  }
  cout << m.size() << endl;
}
int main() {
  { solve(); }
  return 0;
}
