A sequence of complexly computable functions

Specific Boolean functionsfn,t(x1,...,xn) 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 functionsfn,t are the most complex, to within a multiplicative constant, of the n-argument functions.