Make sure that the distribution of queries in random order is equal

[bigerl]

Idea: Shuffle a list where each query is contained n times. Use as stack picking one query from the top. When half of them is used up, add anther shiffled list to the bottom where each query is contained n/2 times.

@nck-mlcnv: having two lists where queries picked from the first end up in the second.