#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <math.h>
#include <array>

using namespace std;
using ll = long long;

signed main()
{
	iostream::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;
	vector<int> points(n);
	for (int i = 0; i < n; i++) cin >> points[i];

	vector<pair<array<int, 2>, vector<int>>> ans;

	for (int k = 1; k < n/2+1; k++) {
		int pps = n / k;
		if (k*pps != n) continue;
		int len = 0;
		for (int i = 0; i < n; i += pps) {
			len = max(len, points[i + pps - 1] - points[i]);
		}
		int lastcovered = points[pps - 1], lastpi = pps - 1;
		ans.push_back({ {k, len}, { points[pps-1]-len } });
		if (k == 1) continue;

		while (lastpi + pps < n) {
			if (lastpi + pps + 1 >= n || points[lastpi + pps + 1] - lastcovered - 1 > len) break;
			lastpi += pps;
			lastcovered = min(points[lastpi], lastcovered + len);
			ans.back().second.push_back(lastcovered - len + 1);
		}
		if (lastpi + pps != n-1) ans.pop_back();
		else {
			ans.back().second.push_back(points[lastpi + 1]);
		}
	}
	cout << ans.size() << '\n';
	for (int i = 0; i < ans.size(); i++) {
		cout << ans[i].first[0] << ' ' << ans[i].first[1] << '\n';
		for (int j = 0; j < ans[i].second.size(); j++) cout << ans[i].second[j] << '\n';
	}
}