#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;

typedef long long ll;
const ll MOD=1e9+7;
const ll base=1123;
const int MAXN=5e5+5;

string s;
int n;
ll pow[MAXN],Hash[MAXN];
bool l[MAXN],r[MAXN];

void Init(){
    s=' '+s;
    pow[0]=1;
    for(int i=1;i<=n;i++) pow[i]=(1ll*pow[i-1]*base)%MOD;
    for(int i=1;i<=n;i++) Hash[i]=(1ll*Hash[i-1]*base+s[i]-'a')%MOD;
}

ll get(int l,int r){
    return ((1ll*Hash[r]-1ll*Hash[l-1]*pow[r-l+1])%MOD+MOD)%MOD;
}

int main(){
    cin >> s;
    n=s.length();
    bool same=1;
    for(int i=1;i<s.length();i++) if(s[i]!=s[i-1]){same=0;break;}
    if(same) return printf("%d\n1",s.length()),0;
    Init();
    for(int i=1;i<=n;i++)
        for(int j=i*2;j<=n;j+=i){
            if(get(1,i)==get(j-i+1,j)) l[j]=1;
            else break;
        }
    for(int i=1;i<=n;i++)
        for(int j=n-i*2+1;j>=1;j-=i){
            if(get(j,j+i-1)==get(n-i+1,n)) r[j]=1;
            else break;
        }
    if(!l[n]) return printf("1\n1"),0;
    int ans=0;
    for(int i=1;i<n;i++) if(!l[i]&&!r[i+1]) ans++;
    printf("2\n%d",ans);
}
