#include <bits/stdc++.h>
using namespace std;
inline int gi() {
  int f = 1, sum = 0;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    sum = (sum << 3) + (sum << 1) + ch - '0';
    ch = getchar();
  }
  return f * sum;
}
const int N = 1000010;
char s[N];
int n, nxt[N], pre[N];
const unsigned long long base = 19260817;
unsigned long long pw[N], Hash[N];
void init() {
  pw[0] = 1;
  for (int i = 1; i <= n; i++)
    pw[i] = pw[i - 1] * base, Hash[i] = Hash[i - 1] * base + s[i];
  int j = 0;
  nxt[1] = 0;
  for (int i = 2; i <= n; i++) {
    while (j && s[j + 1] != s[i]) j = nxt[j];
    if (s[j + 1] == s[i]) j++;
    nxt[i] = j;
  }
  j = n + 1;
  pre[n] = n + 1;
  for (int i = n - 1; i; i--) {
    while (j <= n && s[j - 1] != s[i]) j = pre[j];
    if (s[i] == s[j - 1]) j--;
    pre[i] = j;
  }
}
unsigned long long gethash(int l, int r) {
  return Hash[r] - Hash[l - 1] * pw[r - l + 1];
}
bool check(int id) {
  int flag1 = (!nxt[id] || (id) % (id - nxt[id]));
  int flag2 =
      (pre[id + 1] == n + 1 || (n - id) % (n - id - (n - pre[id + 1] + 1)));
  return (flag1 & flag2);
}
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  int flag = 1;
  for (int i = 2; i <= n; i++)
    if (s[i] != s[1]) {
      flag = 0;
      break;
    }
  if (flag) return printf("%d\n%d\n", n, 1), 0;
  init();
  flag = 1;
  int ans = 0;
  for (int i = 2; i * i <= n; i++)
    if (n % i == 0) {
      int x = i;
      if (gethash(1, n - x) == gethash(x + 1, n)) {
        flag = 0;
        ans = x;
        break;
      }
      x = n / i;
      if (gethash(1, n - x) == gethash(x + 1, n)) {
        flag = 0;
        ans = x;
        break;
      }
    }
  if (flag) return printf("%d\n%d\n", 1, 1), 0;
  printf("%d\n", n / ans);
  int sum = 0;
  for (int i = 1; i < n; i++)
    if (check(i)) sum++;
  printf("%d\n", sum);
  return 0;
}
