IR-MO-R2 2017 Problem 3

Let $n$ be a natural number divisible by $3$ . We have a $n \times n$ table and each square is colored either black or white. Suppose that for all $m \times m$ sub-tables from the table ( $m > 1$ ), the number of black squares is not more than white squares. Find the maximum number of black squares.