#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

// z-algotirhm O(|S|)
vector<ll> Zalgo(string s) {
    const ll n = s.size();
    vector<ll> v(n);
    v[0] = n;
    int i = 1, j = 0;
    while (i < n) {
        while (i+j < n && s[j] == s[i+j]) ++j;
        v[i] = j;
        if (j == 0) { ++i; continue;}
        int k = 1;
        while (i+k < n && k+v[k] < j) v[i+k] = v[k], ++k;
        i += k; j -= k;
    }
	return v;
}

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    string s;
    cin >> s;
    const ll n = s.size();

    // 全部同じ文字か？
    {
        bool flag = true;
        FOR(i, 1, n) {
            if(s[i] != s[0]) {
                flag = false;
                break;
            }
        }
        if(flag) {
            cout << n << endl << 1 << endl;
            return 0;
        }
    }

    // 項数が1か？
    auto z = Zalgo(s);
    // cout << z << endl;
    {
        bool ans1 = true;
        FOR(i, 1, n) {
            if(n%i) continue;
            // 周期iで良い文字列ならtrue
            bool flag = false;
            for(ll j=0; j<n; j+=i) {
                if(z[j] < i) {
                    flag = true;
                    break;
                }
            }
            if(!flag) ans1 = false;
        }
        if(ans1) {
            cout << 1 << endl << 1 << endl;
            return 0;
        }
    }

    // 項数2
    {
        vector<bool> l(n, true);
        FOR(i, 1, n+1) {
            bool fl = false;
            for(ll j=i; j<n; j+=i) {
                if(z[j] < i) fl = true;
                // cout << j << " " << fl << endl;
                if(!fl && j+i-1<n) l[j+i-1] = false;
            }
            // cout << "i=" << i <<  " l=" << l << endl;
        }

        vector<bool> r(n, true);
        reverse(ALL(s));
        z = Zalgo(s);
        FOR(i, 1, n+1) {
            bool fr = false;
            for(ll j=i; j<n; j+=i) {
                if(z[j] < i) fr = true;
                // cout << j << " " << fr << endl;
                if(!fr && j+i-1<n) r[j+i-1] = false;
            }
            // cout << "i=" << i <<  " r=" << r << endl;
        }
        reverse(ALL(r));
        // cout << l << endl << r << endl;

        ll ret = 0;
        REP(i, n-1) if(l[i] && r[i+1]) ret++;
        cout << 2 << endl << ret << endl;
    }

    return 0;
}


Measured memory_bytes: 9136