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

int main(){
    ll n;cin>>n;
    vector<ll> vec(n+1),pref(n+1),dif(n+1);
    for(ll i=1;i<=n;i++){
        ll a;cin>>a;
        vec[i]=a;
        if(i==1){
            dif[1]=0;
            pref[1]=0;
        }else{
            dif[i]=a-vec[i-1]-1;
            pref[i]=pref[i-1]+dif[i]+1;
        }
    }
    dif[0]=1e8;//min(1LL*ll_MAX,1LL*vec[1]-1e9);
    vector<pii> ans;
    vector<vector<ll>> starts;
    ans.push_back({1,pref[n]});
    starts.push_back({vec[1]});
    for(ll ii=2;ii*ii<=n;ii++){
        if(n%ii)continue;
        vector<ll> iii;
        if(ii*ii==n) iii={ii};
        else iii={ii,n/ii};
        for(ll i:iii){
            ll len=0;
            vector<ll> kellmeg(n+1);
            for(ll j=i;j<=n;j+=i){
                len=max(len,vec[j]-vec[j-i+1]);
                kellmeg[j]=vec[j]-vec[j-i+1];
            }
            for(ll j=i;j<=n;j+=i){
                kellmeg[j]=len-kellmeg[j];
            }
            vector<ll> seged=dif,kezdo;
            bool ok=true;
            for(ll j=i;j<=n;j+=i){
                ll x=0;
                if(seged[j-i]>=kellmeg[j]){
                    kezdo.push_back(vec[j-i+1]-kellmeg[j]);
                    continue;
                }else{
                    x=kellmeg[j]-seged[j-i];
                    kezdo.push_back(vec[j-i+1]-seged[j-i]);
                }
                if(j==n||x>seged[j+1]){
                    ok=false;break;
                }else seged[j+1]-=x;
            }
            if(ok){
                ans.push_back({i,len});
                starts.push_back(kezdo);
            }
        }
    }
    cout<<ans.size()<<'\n';
    for(ll i=0;i<(ll)ans.size();i++){
        cout<<ans[i].first<<' '<<ans[i].second<<'\n';
        for(ll j:starts[i])cout<<j<<'\n';
    }
}