#include <bits/stdc++.h>
#define pii pair<int,int>
#define pb push_back
#define yes "YES"
#define no "NO"
#define ll long long
#define MOD 1000000007
#define all(x) x.begin(),x.end()
#define MOD2 998244353
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T> 
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve(int cas){
    int n;
    cin>>n;
    vector<ll> s(n+1);
    for (int i = 1; i <= n; i++) cin>>s[i];
    int sz = s[1];
    vector<ll> res(sz, INT_MAX);
    int nxt = 0;
    for (int i = 1; i <= n; i++){
        ll rem = 0;
        for (int j = 0; j < nxt; j++){
            rem+=i%res[j];
        }
        rem+=(sz-nxt)*i;
        rem-=s[i];
        while (rem > 0){
            res[nxt] = i;
            rem-=i;
            nxt++;
        }
    }
    cout<<sz<<" ";
    for (int i = 0; i < sz; i++) cout<<res[i]<<" ";
}
int main(){
    int t=1;
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //cin>>t;
    for (int i = 1; i<=t; i++){
        solve(i);
    }
    return 0;
}