#include<bits/stdc++.h>
using namespace std;
const int N=5e5+10;
char s[N];
char s1[N];
int nxt[N],nxt1[N];//next数组
void kmp(char *t,int *nxt){//t为去匹配,s为被匹配
	int i,j;
	int len1=strlen(t+1);
	nxt[0]=nxt[1]=0;
	for(i=2,j=0;i<=len1;i++){
		while(j&&t[j+1]!=t[i])j=nxt[j];
		if(t[j+1]==t[i])++j;
		nxt[i]=j;
	}
}
bool check(int x,int len){
	int f1,f2;
	int l1=x-nxt[x],l2=len-x-(nxt1[len-x]);
	//if(x==2)cout<<l1<<" "<<l2<<endl;
	if(x==1||l1==x||x%l1!=0)f1=1;
	else f1=0;
	if(len-x==1||l2==len-x||(len-x)%l2!=0)f2=1;
	else f2=0;
	return (f1&&f2);
}
int main()
{
	//freopen("H:\\c++1\\in.txt","r",stdin);
	//freopen("H:\\c++1\\out.txt","w",stdout);
	scanf("%s",s+1);
	int len=strlen(s+1);
	for(int i=1;i<=len;i++){
		s1[i]=s[len-i+1];
	}
	kmp(s,nxt);kmp(s1,nxt1);
	int temp=len-nxt[len];
	if(temp==1){
		printf("%d\n%d\n",len,1);return 0;
	}
	if(temp!=len&&len%temp==0){
		int ans=0;
		for(int i=1;i<len;i++){
			if(check(i,len))ans++;
		}
		printf("2\n%d\n",ans);
	}
	else{
		printf("1\n1\n");
	}
	return 0;
}