#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "functional"

using namespace std;

//constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-8;

//int N, M, K, H, W, L, R;
long long int N, M, K, H, W, L, R;

template< unsigned mod >
struct RollingHash {
	vector< unsigned > hashed, power;

	inline unsigned mul(unsigned a, unsigned b) const {
		unsigned long long x = (unsigned long long) a * b;
		unsigned xh = (unsigned)(x >> 32), xl = (unsigned)x, d, m;
		asm("divl %4; \n\t" : "=a" (d), "=d" (m) : "d" (xh), "a" (xl), "r" (mod));
		return m;
	}

	RollingHash(const string &s, unsigned base = 10007) {
		int sz = (int)s.size();
		hashed.assign(sz + 1, 0);
		power.assign(sz + 1, 0);
		power[0] = 1;
		for (int i = 0; i < sz; i++) {
			power[i + 1] = mul(power[i], base);
			hashed[i + 1] = mul(hashed[i], base) + s[i];
			if (hashed[i + 1] >= mod) hashed[i + 1] -= mod;
		}
	}

	unsigned get(int l, int r) const {
		unsigned ret = hashed[r] + mod - mul(hashed[l], power[r - l]);
		if (ret >= mod) ret -= mod;
		return ret;
	}

	unsigned connect(unsigned h1, int h2, int h2len) const {
		unsigned ret = mul(h1, power[h2len]) + h2;
		if (ret >= mod) ret -= mod;
		return ret;
	}

	int LCP(const RollingHash< mod > &b, int l1, int r1, int l2, int r2) {
		int len = min(r1 - l1, r2 - l2);
		int low = -1, high = len + 1;
		while (high - low > 1) {
			int mid = (low + high) / 2;
			if (get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid;
			else high = mid;
		}
		return (low);
	}
};

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

	string s;
	cin >> s;
	set<char>ss;
	for (auto i : s)ss.insert(i);
	if (ss.size() == 1) {
		cout << s.size() << endl;
		cout << 1 << endl;
		return 0;
	}

	//assert(0);

	N = s.size();
	RollingHash<MOD> rh(s);
	bool flag = true;
	for (int i = 2; i*i <= N; i++) {
		bool box = false;
		if (N%i)continue;
		for (int j = i * 2 - 1; j < N; j += i) {
			if (!box&&rh.get(j - i + 1, j + 1) != rh.get(0, i))box |= 1;
		}
		flag &= box;
		box = false;
		for (int j = N/i * 2 - 1; j < N; j += N/i) {
			if (!box&&rh.get(j - (N/i) + 1, j + 1) != rh.get(0, N/i))box |= 1;
		}
		flag &= box;
	}
	if (flag) {
		//assert(0);
		cout << 1 << endl;
		cout << 1 << endl;
		return 0;
	}

	//assert(0);

	cout << "2\n";
	reverse(s.begin(), s.end());
	RollingHash<MOD> rrh(s);
	vector<int>l(N, 1);
	vector<int>r(N, 1);
	for (int i = 1; i < N; i++) {
		int add = 0;
		for (int j = i * 2 - 1; j < N; j += i) {
			if (!add&&rh.get(j - i + 1, j+1) != rh.get(0, i))add |= 1;
			l[j] &= add;
			//cout << "L " << i << " " << j << " " << add << endl;
		}
	}
	for (int i = 1; i < N; i++) {
		int add = 0;
		for (int j = i * 2 - 1; j < N; j += i) {
			if (!add&&rrh.get(j - i + 1, j+1) != rrh.get(0, i))add |= 1;
			r[j] &= add;
			//cout << "R " << i << " " << j << " " << add << endl;
		}
	}
	int ans = 0;
	for (int i = 0; i < N - 1; i++) {
		ans += l[i] && r[N - i - 2];
	}
	cout << ans << endl;
	//for (int i = 0; i < N; i++)cout << i << " " << l[i] << endl;
	//for (int i = 0; i < N; i++)cout << i << " " << r[i] << endl;
}

Measured memory_bytes: 12572