#include<bits/stdc++.h>
using namespace std;

const int N = 5e5;

void make_fail(string s, int *fal){
	int l = 0;
	for(int i=1;i<s.size();i++){
		if(s[i] == s[l]){
			fal[i] = ++l;
		} else {
			if(l == 0){
				fal[i] = 0;
			} else {
				l = fal[l-1];
				i--;
			}
		}
	}
}

bool cek(int id, int *fal){
	int pan = id;
	int tmp = pan - fal[id-1];
//	cout << tmp << " " << endl;
	return (pan%tmp != 0 || tmp==pan);
}

string s,s2;
int fal[N+5];
int fal2[N+5];

int main(){
	cin >> s;
	make_fail(s,fal);
//	cout << ">> " ;
//	for(int i=0;i<s.size();i++){
//		cout << fal[i] << " ";
//	}
//	cout << endl;
	int tmp = s.size() - fal[s.size()-1];
	if(s.size()%tmp!=0 || tmp == s.size()){
		printf("1\n1\n");
		return 0;
	}
	if(tmp == 1){
		printf("%d\n",s.size());
		printf("1\n");
		return 0;
	}
	s2 = s;
	reverse(s2.begin(),s2.end());
	make_fail(s2,fal2);
//	for(int i=0;i<s.size();i++){
//		cout << fal2[i] << " ";
//	}
//	cout << endl;
	int ans = 0;
	for(int i=1;i<s.size();i++){
//		cout << ">> " << i << endl;
		if(cek(i,fal) && cek(s.size()-i,fal2)) ans++;
	}
//	if(mult == 2) ans++;
	printf("2\n");
	printf("%d\n",ans);
	return 0;
}