#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pll=pair<ll, ll>;

ll n;
vector<ll> vec;
vector<vector<ll>> out;

void v(ll x){
    vector<ll> megoldas(1, n/x);
    ll hossz=0;
    for (ll i=0; i<n; i+=x)
        hossz=max(hossz, vec[i+x-1]-vec[i]);
    megoldas.push_back(hossz);
    ll current=vec[x-1]-hossz;
    for (ll i=0; i<n; i+=x){
        megoldas.push_back(current);
        current=max(current+hossz, vec[i+x-1]);
        if (i!=n-x && current>=vec[i+x]) return;
        current++;
        if (i!=n-x) current=max(current, vec[i+x+x-1]-hossz);
    }
    out.push_back(megoldas);
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n;
    vec.assign(n, 0);
    for (ll i=0; i<n; i++) cin >> vec[i];
    for (ll i=2; i<=n; i++){
        if (n%i==0){
            v(i);
        }
    }
    cout << out.size() << '\n';
    for (auto& z:out){
        cout << z[0] << ' ' << z[1] << '\n';
        for (ll i=2; i<z.size(); i++) cout << z[i] << '\n';
    }
}