#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define xx first
#define yy second
#define endl "\n"
#define lowbit(x) x & (-x)
#define int long long
#define ull unsigned long long
#define pb push_back
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define Ysanqian ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 1e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 18446, P = 13331;
const double eps = 1e-8;
int n;
int a[N];
bool flag;
vector<int> ans;
void solve()
{
  cin >> n;
  for (int i = 1; i <= n; i++)
    cin >> a[i];

  int num = a[1];
  int cnt = a[1];
  for (int i = 2; i <= n; i++)
  {
    if (a[i] < cnt * i)
    {
      int sum = 0;
      for (auto ed : ans)
        sum += i % ed;
      a[i] -= sum;
      int x = a[i] / i;
      int y = cnt;
      y -= x;
      cnt -= y;
      for (int j = 1; j <= y; j++)
      {
        ans.pb(i);
        if (ans.size() == a[1])
        {
          flag = 1;
          break;
        }
      }
      if (flag)
        break;
    }
  }
  cout << a[1] << ' ';
  if (a[1] == 1)
    cout << 2 << endl;
  else
    for (auto ed : ans)
      cout << ed << ' ';
}
signed main()
{
  Ysanqian;
  int T;
  T = 1;
  // cin >> T;
  while (T--)
    solve();
  return 0;
}