Yuri and Vlad are playing a game on the table $4 \times 100$. Firstly, Yuri chooses $73$ squares $2 \times 2$ (squares can intersect, but cannot be equal). Then Vlad colours the cells of the table in $4$ colours such that in any row and in any column, and in any square chosen by Yuri, there were cells of all 4 colours. After that Vlad pays 2 rubles for every square $2 \times 2$, not chosen by Yuri, which cells of all 4 colours. What is the maximum possible number of rubles Yuri can get regardless of Vlad's actions M. Shutro