#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint operator^(const ll& t)const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}
	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

///////////////////////////

vector<ll> z_algo(vector<ll> S) {//0-index
	ll N = S.size();

	vector<ll> A(N, 0);


	ll c = 0;
	repn(i, N-1) {
		if (c>0&&i - c + A[i - c] < A[c]) { A[i] = A[i - c]; }
		else {
			ll j = max(0, c + A[c] - i);
			while (i + j < N && S[j] == S[i + j]) { j++; }
			A[i] = j;
			c = i;
		}
	}

	A[0] = N;

	return A;
}

vector<bool> notgood(vector<ll> a) {
	ll N = a.size();
	vector<ll> Z = z_algo(a);
	vector<bool> ret(N+1, 0);

	//rep(i, N) cout << Z[i] <<" ";
	//cout << endl;
	
	ll d = 1;
	while (d < N) {
		if (Z[d] < d) { d++; continue; }
		for (ll i = 2 * d; i <= N; i += d) {
			if (Z[i - d] < d) {
				ll x = i - d;
				d = x / 2 + 1;
				break;
			}
			ret[i] = 1;

			if (i + d > N) { d++; break; }
		}
	}

	return ret;

}


int main() {
	string S;
	cin >> S;

	ll N = S.size();

	bool same = 1;
	rep(i, N) {
		if (S[0] != S[i]) { same = 0; }
	}

	if (same) {
		cout << N << endl;
		cout << 1 << endl;
		return 0;
	}

	vector<bool> a(N + 1, 0);

	vector<ll> s(N);
	rep(i, N) s[i] = S[i];

	vector<bool> ng = notgood(s);
	rep(i, N+1) {
		if (ng[i]) { a[i] = 1; }
	}

	rep(i, N) s[i] = S[N - 1 - i];
	ng = notgood(s);
	rep(i,N+1){
		if (ng[N - i]) { a[i] = 1; }
	}


	if (!a[0]) {
		cout << 1 << endl;
		cout << 1 << endl;
		return 0;
	}

	cout << 2 << endl;
	ll ans = 0;
	repn(i, N - 1) { if (!a[i]) { ans++; } }

	cout << ans << endl;
	
	
}


Measured memory_bytes: 16568