There is a board with $n$ rows and $12$ columns. Each cell of the board contains a $1$ or a $0$. The board has the following properties: All rows are distinct. Each row contains exactly $4$ cells with $1$. For every $3$ rows, there is a column that intersects them in $3$ cells with $0$. Find the largest $n$ for which a board with these properties exists.