#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin>>n;
    vector<int> g(n,0);
    vector<int> p;
    int x;
    cin>>x;
    g[0]=x;
    p.push_back(x);
    for (int i=1; i<n;i++){
        int x;
        cin>>x;
        g[i]=x-p[i-1];
        p.push_back(x);
    }
    sort(g.begin(),g.end());
    int mst=-1;
    int i=0;
    int ans=0;
    vector<int> m;
    while (i<n){
        if (g[i]<mst){
            ans++;
            i++;
        }
        else{
            m.push_back(ans);
            mst=g[i]+1;
        }
    }
    cout<<m.size()<<endl; 
    for (int x:m) cout<<x+1<<" ";
    cout<<ans+1;
}