There is a square of checkered paper measuring $102 \times 102$ squares and a connected figure of unknown shape, consisting of 101 cells. What is the largest number of such figures that can be cut from this square with a guarantee? A figure made up of cells is called connected if any two its cells can be connected by a chain of its cells in which any two adjacent cells have a common side.