#include<bits/stdc++.h>
#define inf 0x7fffffff
#define RG register
#define maxn 500005
#define maxm 205
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
inline ll read(){
    ll x = 0, f = 1;
    char ch = getchar();
    while(ch > '9' || ch < '0') {if(ch == '-') f = -1;ch = getchar();}
    while(ch >= '0' && ch <= '9'){x = x *10 + ch -'0';ch = getchar();}
    return x * f;
}

int n, m, f1[maxn], f2[maxn], x, ans;
char ch[maxn], s[maxn];
int main(){
	int i, j, k;
	scanf("%s", ch + 1);
	n = strlen(ch + 1);
	for(i = 2, j = 0;i <= n;i++){
		while(j && ch[j + 1] != ch[i]) j = f1[j];
		if(ch[j + 1] == ch[i]) j++;
		f1[i] = j;
	}
	for(i = 1;i <= n;i++) s[i] = ch[n - i + 1];
	for(i = 2, j = 0;i <= n;i++){
		while(j && s[j + 1] != s[i]) j = f2[j];
		if(s[j + 1] == s[i]) j++;
		f2[i] = j;
	}
	if(n % (n - f1[n]) != 0 || f1[n] == 0) {printf("1\n1");return 0;} 
	if(n - f1[n] == 1) {printf("%d\n1", n);return 0;}
	for(i = 1;i < n;i++){
		k = n - i;
		if((i % (i - f1[i]) != 0 || f1[i] == 0) && (k % (k - f2[k]) != 0 || f2[k] == 0)) ans++;
	}
	printf("2\n%d",ans);
	return 0;
}
