#include<bits/stdc++.h> using namespace std; vector<int> computeNext(const string& s) { int n = s.length(); vector<int> next(n, 0); for (int i = 1, j = 0; i < n; i++) { while (j > 0 && s[i] != s[j]) { j = next[j - 1]; } if (s[i] == s[j]) { j++; } next[i] = j; } return next; } int findMinimalCycleLength(const string& s) { int n = s.length(); vector<int> next = computeNext(s); int candidate = n - next[n - 1]; if (n % candidate == 0) { return candidate; } return n; }

int main() { string s; cin >> s; int result = findMinimalCycleLength(s); cout << result << endl; return 0; }