Statement

The new year has come and just like all the competitive programmers, our hero Stefan received an array with positive integers as a Christmas present as well! Now he wants to explore the array and to find new interesting properties as he always likes doing. For this year, he wants to find out the maximum number of values we can take from the array such that both the bitwise AND and the bitwise XOR are different from zero\footnotemark\global<t\saved@Href@A\Hy@footnote@currentHref. Since this is too easy for him, he also modifies his array and wants you to answer to the same question after each update. <t\Hy@footnote@currentHref\saved@Href@A \footnotetextYou can find more information about bitwise operations at \urlhttps://en.wikipedia.org/wiki/Bitwise_operation#Bitwise_operators. In C, C++ and Python the operators for bitwise-and and bitwise-xor are & and \^, respectively. In Pascal they are and and xor. \stepcounterfootnote \makeatother