Cleaning the Dishes

Bessie and Canmuu are teaming up to wash a massive pile of $N$ ($1 \le N \le 10{,}000$) dirty dishes. Bessie washes the dishes; Canmuu dries them.

Each dish has a unique serial number from $1$ to $N$. At the start, all dishes form a single unwashed pile, stacked in order with dish $1$ on top and dish $N$ on the bottom.

The two cows take turns following a list of commands. Each command has a type $C_i$ ($1 \le C_i \le 2$) and a count $D_i$ ($1 \le D_i \le N$):

• $C_i = 1$ (wash): Bessie takes $D_i$ dishes one at a time from the top of the unwashed pile, washes each, and places it on top of the washed-but-not-dried pile. Because she moves them one by one, their order is reversed.
• $C_i = 2$ (dry): Canmuu takes $D_i$ dishes one at a time from the top of the washed-but-not-dried pile, dries each, and places it on top of the cleaned pile. Again the order is reversed.

Every command always has enough dishes available to process, and after the last command every dish has been washed and dried. Report the final order of the cleaned pile, from top to bottom.

For example, suppose there are $5$ dishes. The unwashed pile starts like this:

1  <- top
2
3
4
5  <- bottom

After the commands "wash 3, dry 2, wash 2, dry 3", the cleaned pile ends up in this top-to-bottom order:

1  <- top
4
5
2
3  <- bottom

• Line $1$: a single integer $N$, the number of dishes to wash and dry.
• Lines $2$ and onward: each line contains a command type $C_i$ and a count $D_i$, separated by a space.

• Lines $1$ to $N$: line $i$ contains the serial number of the $i$-th dish in the cleaned pile, counted from the top.