B. Array Fix

You are given an integer array 𝑎 of length 𝑛.

You can perform the following operation any number of times (possibly zero): take any element of the array 𝑎, which is at least 10

10, delete it, and instead insert the digits that element consisted of in the same position, in order they appear in that element.

For example:

• if we apply this operation to the 3-rd element of the array [12,3,45,67], then the array becomes [12,3,4,5,67] if we apply this operation to the 2-nd element of the array [2,10] then the array becomes [2,1,0]

Your task is to determine whether it is possible to make 𝑎 sorted in non-descending order using the aforementioned operation any number of times (possibly zero).