#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}

string s;
int A[500001],B[500001];
void kmp(string s,int* A){
	A[0]=-1;
	int j=-1;
	rep(i,s.size()){
		while(j>=0&&s[i]!=s[j]) j=A[j];
		j++;
		A[i+1]=j;
	}
}
int main(){
	string s;
	cin>>s;
	int N=s.size();
	vector<int> ds;
	rep1(i,N-1){
		if(N%i==0) ds.pb(i);
	}
	int T=-1;
	for(int d:ds){
		bool is=1;
		rep(i,N) if(s[i]!=s[i%d]) is=0;
		if(is){
			T=d;
			break;
		}
	}
	if(T==-1){
		cout<<1<<endl<<1<<endl;
	}else if(T==1){
		cout<<N<<endl<<1<<endl;
	}else{
		kmp(s,A);
		rep(i,N) A[i]=i+1-A[i+1];
		reverse(all(s));
		kmp(s,B);
		rep(i,N) B[i]=i+1-B[i+1];
		int cnt=0;
		rep1(i,N-1){
			if( (A[i-1]==i || i%A[i-1]>0) && (B[N-1-i]==N-i || (N-i)%B[N-1-i]>0) ) cnt++;
		}
		cout<<2<<endl<<cnt<<endl;
	}
}
