You can approach thge problem by first switching from rectangular to polygonal fields (with fixed side lengths $a$). By a compactness argument, a maximal such polygon exists. If $A,B,C,D$ are four (out of $n$) consecutive points in such a constellation, it is still easy to show that the contribution of $ABCD$ to the total area (under the constraint $AB=BC=CD=a$ and with $A,D$ fixed) is maximal when $BC\|AD$ and hence $\angle CBA = \angle DCB$. This shows that the regular $n$gon is the optimal $n$gon.