Consider the combinational complexity L(f) of Boolean functions over the basis $\Omega = {f|f:{0,1}^{2} \rightarrow {0,1}}$. A new Method for proving linear lower bounds of size 2n is presented. Combining it with methods presented in [7] and [9], we establish for a special set of functions $f^{n}:{0,1} : 2.25n \leq L(f) \leq 6n$.