USEMO 2021 Problem 1

Let $n$ be a fixed positive integer and consider an $n\times n$ grid of real numbers. Determine the greatest possible number of cells $c$ in the grid such that the entry in $c$ is both strictly greater than the average of $c$ 's column and strictly less than the average of $c$ 's row.

Proposed by Holden Mui