Arranging the Inventory

Chef has an inventory, which can be represented as a row of $N$ cells (numbered $1$ through $N$). Each cell is either empty or contains a box. Chef wants to rearrange the boxes in such a way that they are all on the left side of the inventory (so if there are $K$ boxes, they should occupy the leftmost $K$ cells). He may perform two types of moves: - choose a cell $i$ ($1 \le i \le N-2$); if cells