On the complexity of a cyclic shift of a set of real numbers

The complexity of implementing a cyclic shift of a $2^n$-tuple of real numbers by Boolean circuits over the basis consisting of a ternary choice function and all binary Boolean functions is shown to be $2^n n$.