Storage of binary information in plane logic networks

We consider a problem on the storage of binary information in plane logic networks that are schemes made up of the elements $\&$, $\vee$ and $-$ that operate with delay of one cycle, an element $G$ of delay of one cycle, and switching elements located at the nodes of a rectangular plane lattice. We show that for any natural number $n$ there exists an $n$-cell of storage $\Sigma(n)$ whose area is asymptotically equal to $n$.