We introduce and study the following natural total search problem, which we call the {\it heavy element avoidance} (Heavy Avoid) problem: for a distribution on N bits specified by a Boolean circuit sampling it, and for some parameter \delta(N) \ge 1/\poly(N) fixed in advance, output an N-bit string that has ... more >>>