#include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 998244353
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
bool gd[514514],rd[514514];
signed main(){
	string s,r;
	cin>>s;
	r = s;
	reverse( r.begin(), r.end() );
	int n = s.size();
	vector<int> a(n),b(n);
	a[0] = n;
	int i=1,j=0;
	while( i < s.size() ){
		while( i + j < s.size() && s[j] == s[i+j] ) j++;
		a[i] = j;
		if( j == 0 ){ i++; continue; }
		int k=1;
		while( i+k < s.size() && k+a[k] < j ){
			a[i+k] = a[k];
			k++;
		}
		i+=k; j-=k;
	}
	for(int i=0;i<n;i++)gd[i]=true;
	for(int i=1;i<n;i++){
		for(int j=2;(j-1)*i<=a[i];j++){
			gd[i*j-1] = false;

		}
	}
	i=1;j=0;
	while( i < r.size() ){
		while( i + j < r.size() && r[j] == r[i+j] ) j++;
		b[i] = j;
		if( j == 0 ){ i++; continue; }
		int k=1;
		while( i+k < r.size() && k+b[k] < j ){
			b[i+k] = b[k];
			k++;
		}
		i+=k; j-=k;
	}
	for(int i=0;i<n;i++)rd[i]=true;
	for(int i=1;i<n;i++){
		for(int j=2;(j-1)*i<=b[i];j++){
			rd[i*j-1] = false;

		}
	}
	if( gd[n-1] == true ){
		cout<<1<<endl<<1<<endl;
		return 0;
	}
	int cnt = 0;
	for(int i=0;i<n-1;i++){
		if( gd[i] == true && rd[n-2-i] == true)cnt++;
	}
	if( cnt == 0 ){
		cout<<n<<endl<<1<<endl;
		return 0;
	}
	else{
		cout<<2<<endl<<cnt<<endl;
		return 0;
	}
	return 0;
}