#include <bits/stdc++.h>

#define el '\n'
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long ll;
typedef long double ld;

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void testCase() {
    int n;
    cin >> n;

    vector<string> v(n);
    for (int i = 0, a; i < n; i++)
        cin >> a, v[i] = string(a, '0');

    v[0][0] = '1';

    for (int i = 1; i < n; i++) {
        int j;
        for (j = 0; j < min(v[i].size(), v[i - 1].size()); j++)
            v[i][j] = v[i - 1][j];

        j--;

        while (v[i][j] == '9')
            v[i][j] = '0', j--;

        v[i][j]++;
    }

    assert(is_sorted(v.begin(), v.end()));

    for (auto &i: v)
        cout << i << ' ';
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();
}