We have $x_1,x_2, \ldots, x_n$ arranged in a circle, where $n\geq 3$.
Every $x_i$ belongs to $\{1,−1\}$.
We can choose arbitrarily $3$ consequent numbers and know their product.
What is the minimum number of questions to know the product of the entire circle?