Given real numbers whose sum is zero, find one of the numbers that is non-negative. In the model under consideration, an algorithm is allowed to compute linear forms in each time step until it knows an answer. We prove that exactly time steps are required. Some connections with parallel group-testing problems are pointed out.
