OBM 2022 Problem 6

Some cells of a $10 \times 10$ are colored blue. A set of six cells is called gremista when the cells are the intersection of three rows and two columns, or two rows and three columns, and are painted blue. Determine the greatest value of $n$ for which it is possible to color $n$ chessboard cells blue such that there is not a gremista set.