The paper deals with load balancing in a set of N queues on a line by a local choice policy. Each one-server queue has a Poissonian arrival of customers. When a customer arrives at queue i, he joins the least loaded queue between queues i and i + 1. When the load tends to zero, we obtain an asymptotic for the steady-state probability that a queue has m customers. It quantifies the difference between this local choice, no choice and the choice between two queues chosen at random.