A sequence of complexly computable functions

Specific Boolean functions $f_{n,l}(x_1,\dots,x_n)$ are described and a high lower bound of the complexity of calculations using functional elements is obtained for them. In particular, for some values of the parameter $t=t(n)$ the functions $f_{n,t}$ are the most complex, to within a multiplicative constant, of the $n$-argument functions.