Minimize Error

There exists a hidden array $A$ of length $N$ such that there is an integer $X$ ($1 \le X \le N$) satisfying - $A_i = 0$ for $i < X$ - $A_i = 1$ for $i \ge X$ In other words, the array consists of some number of $0$'s followed by only $1$'s, and $X$ is the position of the first $1$. In particular, $A$ definitely contains at least one occurrence of the value $1$. You do not know anything else