Every cell of an $8\times8$ chessboard contains either $1$ or $-1$. It is known that there are at least four rows such that the sum of numbers inside the cells of those rows is positive. Find the maximum number of columns such that the sum of numbers inside the cells of those columns is less than $-3$.

Let's think step by step and output the final answer within \boxed{}.
user