#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];
void init() {
  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;
  }
}
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);
  init();
  if (!nxt[n] || n % (n - nxt[n])) return printf("1\n1\n"), 0;
  if (nxt[n] == n - 1) return printf("%d\n1\n", n), 0;
  int sum = 0;
  for (int i = 1; i < n; i++)
    if (check(i)) sum++;
  printf("2\n%d\n", sum);
  return 0;
}
