#include <bits/stdc++.h>
using namespace std;

#define forn(i,n) for(int i=0;i<(int)(n);i++)
#define si(c) ((int)(c).size())
#define forsn(i,s,n) for(int i = (int)(s); i<((int)n); i++)
#define dforsn(i,s,n) for(int i = (int)(n)-1; i>=((int)s); i--)
#define all(c) (c).begin(), (c).end()
#define D(a) cerr << #a << "=" << a << endl;
#define pb push_back
#define eb emplace_back
#define mp make_pair

#ifdef LOCAL
#define i64 "%lld"
#else
#define i64 "%I64d"
#endif

typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> pii;

vector<int> prefix_function (string s) {
	int n = (int) s.length();
	vector<int> pi (n);
	for (int i=1; i<n; ++i) {
		int j = pi[i-1];
		while (j > 0 && s[i] != s[j]) j = pi[j-1];
		if (s[i] == s[j])  ++j;
		pi[i] = j;
	}
	return pi;
}

bool good(vi &pi, int l) {
    int d = l - pi[l-1];
    return d == l || l%d != 0;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    string s; cin >> s;
    int n = si(s);
    auto pi = prefix_function(s);

    string t = s;
    reverse(all(t));
    auto pi2 = prefix_function(t);

    int d = si(s) - pi.back();
    if (d == n || n%d != 0) cout << "1\n1\n";
    else if (d == 1) cout << n << endl << 1 << endl;
    else {
        cout << 2 << endl;
        int ways = 0;
        forsn(x,1,n) {
            int y = n-x;
            ways += good(pi,x) && good(pi2,y);
        }
        cout << ways << endl;
    }

    return 0;
}
