In a game, two players take turns removing cells from a grid. To remove a cell, a player selects an uneaten cell, places a piece on that cell, and then all cells in the "first quadrant" (the right-angled region created with the lower-left corner of that cell extending upwards and to the right) are removed. For example, placing a piece on a shaded cell in the right image will remove the 4 cells marked with along with the shaded cell itself, where the cells represented by dotted lines were removed earlier. The goal of the game is to force the opponent to remove the last cell. How many different possible situations can appear during the entire course of the game?