Your task is to construct a tower in \(N\) days by following these conditions:
The order in which tower must be constructed is as follows:
Print \(N\) lines denoting the disk sizes that can be put on the tower on the \(i^{th}\) day.
Input format
Note: All the disk sizes are distinct integers in the range of \({1}\ to\ {N}\).
Output format
Print \(N\) lines. In the \(i^{th}\) line, print the size of disks that can be placed on the top of the tower in descending order of the disk sizes.
If on the \(i^{th}\)^{ }day no disks can be placed, then leave that line empty.
Constraints
\(1 \le N \le10^{6}\)
\(1 \le size\ of\ a\ disk \le N\)
On the first day, the disk of size 4 is given. But you cannot put the disk on the bottom of the tower as a disk of size 5 is still remaining.
On the second day, the disk of size 5 will be given so now disk of sizes 5 and 4 can be placed on the tower.
On the third and fourth day, disks cannot be placed on the tower as the disk of 3 needs to be given yet. Therefore, these lines are empty.
On the fifth day, all the disks of sizes 3, 2, and 1 can be placed on the top of the tower.