Given a positive integer , Sisyphus performs a series of operations on squares arranged in a row and numbered from . Initially, there are stones in the square labeled and no stones in the other squares. In each operation, Sisyphus chooses any non-empty square (suppose this square contains stones), takes one stone from it, and moves this stone to another square that is at most units to the right (the stone cannot be placed outside the board). Sisyphus’s goal is to move all stones to the square labeled . Prove that Sisyphus cannot achieve this goal in fewer than operations, where denotes the smallest integer greater than or equal to .