B'Pak Chanek is traveling to Manado. It turns out that OSN (Indonesian National Scientific Olympiad) 2019 is being held. The contestants of OSN 2019 are currently lining up in a field to be photographed. The field is shaped like a grid of size N x 10^{100} with N rows and 10^{100} columns. The rows are numbered from 1 to N from north to south, the columns are numbered from 1 to 10^{100} from west to east. The tile in row r and column c is denoted as (r,c) . There are N provinces that participate in OSN 2019. Initially, each contestant who represents province i stands in tile (i, p) for each p satisfying L_i <= q p <= q R_i . So, we can see that there are R_i-L_i+1 contestants who represent province i . Pak Chanek has a variable Z that is initially equal to 0 . In one operation, Pak Chanek can choose a row i and a positive integer k . Then, Pak Chanek will do one of the two following possibilities: After each operation, the value of Z will change into Z text{ OR } k , with text{OR} being the bitwise OR operation. Note that Pak Chanek can do operations to the same row more than once. Also note that Pak Chanek is not allowed to move contestants out of the grid. There are Q questions. For the j -th question, you are given a positive integer W_j , Pak Chanek must do zero or more operations so that the final value of Z is exactly W_j . Define M as the biggest number such that after all operations, there is at least one column that contains exactly M contestants. For each question, you must find the biggest possible M for all sequences of operations that can be done by Pak Chanek. Note that the operations done by Pak Chanek for one question do not carry over to other questions. The first line contains a single integer N ( 1 <= q N <= q 10^5 ) -- the number of rows in'...