Given a $n \times n$ square table. Exactly one beetle sits in each cell of the table. At $12.00$ all beetles creeps to some neighbouring cell (two cells are neighbouring if they have the common side). Find the greatest number of cells which can become empty (i.e. without beetles) if a) $n=8$ b) $n=9$ Problem Committee of BMO 2011