n = int(raw_input())
b = [0 for i in range(n)]
for i in range(n):
    b[i] = int(raw_input())
a = [0]
for sumDig in b:
    suff = 0
    for x in a:
        suff += x
    for i in range(10000):
        if len(a) == i:
            a.append(0)
        suff -= a[i]
        found = False
        for dig in range(a[i] + 1, 10):
            if dig + suff <= sumDig and sumDig <= dig + suff + i * 9:
                a[i] = dig
                need = sumDig - dig - suff
                for t in range(0, i):
                    a[t] = min(need, 9)
                    need -= a[t]
                found = True
                break
        if found:
            break
    res = ''
    ok = False
    for i in range(len(a) - 1, -1, -1):
        if a[i] != 0:
            ok = True
        if ok:
            res += str(a[i])
    print res