by creating a single element set for each number from [0,𝑛2), we can determine whether π‘žπ‘–=π‘βˆ’1𝑖 has the highest bit on or off

then we can create two element sets, where each element has the second bit off

we can’t do that many checks though…