#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

#define pb push_back
#define fr first
#define sc second

struct MP{
	string s;
	int a[500010];
	void calc_MP(){
		a[0] = -1;
		int j = -1;
		for(int i = 0 ; i < s.size() ; i ++){
			while(j >= 0 && s[i] != s[j])j = a[j];
			j ++;
			a[i+1] = j;
		}
	}
}S,T;

int main(){
	string s;
	cin >> s;
	
	S.s = s;
	T.s = s;
	reverse(T.s.begin(),T.s.end());
	S.calc_MP();
	T.calc_MP();
	
	if(S.a[S.s.size()] == S.s.size()-1){
		printf("%d\n%d\n",(int)s.size(),1);
		return 0;
	}
	if(S.a[S.s.size()] == 0 || S.s.size()%(S.s.size()-S.a[S.s.size()]) != 0){
		printf("%d\n%d\n",1,1);
		return 0;
	}
	int cnt = 0;
	for(int i = 1 ; i <= -1+(int)s.size() ; i ++){
		int j = s.size()-i;
		if((S.a[i] == 0 || i%(i-S.a[i]) != 0)&&(T.a[j] == 0 || j%(j-T.a[j]) != 0))cnt ++;
	}
	printf("%d\n%d\n",2,cnt);
}

