Problem Link : Obtain Two Zeroes

The editorial have very nice solution But what if we have to print X for every operation and also minimum number of operation is intended. Then According to me Binary Search based solution worked here.

And One more thing as this Problem is tagged as Binary Search problem so it made me more curious.

Please help me to write Binary search based solution.

I'm trying to solve the problem C-ORXOR. While reading the editorial of this problem there is a term used Which is Bitwise Exhaustive Search

According to the definition given in editorial For implementation, a useful way is bitwise exhaustive search, in which each combination of N−1 choices of whether or not to put the bars is regarded as N−1-digit binary integer, and corresponds to an integer between 0 (inclusive) and 2^(N−1)(exclusive).

Can Someone Please explain this Term with example !!!