Statement

Mr. X enjoys solving and especially talking a lot about bitwise operations, even at the New Year's Day party. While celebrating with his friends, he came up with the following challenge. There are q queries, and in each query you are given a positive integer a_i (i=0… q-1). You are required to answer the following question: What is the bitwise XOR of the integers in the interval [0, a_i] and what is the maximum bitwise XOR we can get by removing exactly one integer from that interval? Your task is to solve the challenge of Mr. X.