#include <bits/stdc++.h>
using namespace std;
const double PI = 3.141592653589793238;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= 1000000007;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
  }
  return res;
}
char str[200005];
int lps[200005];
int kmp() {
  int i = 0, j = 1, m = strlen(str);
  lps[0] = 0;
  while (j < m) {
    while (i && str[i] != str[j]) {
      i = lps[i - 1];
    }
    if (str[i] == str[j]) ++i;
    lps[j++] = i;
  }
  if (m % (m - i) == 0) return (m - i);
  return m;
}
int main() {
  scanf("%s", str);
  cout << kmp() << endl;
  return 0;
}
