Counting Events

While waiting for Thanos on Titan, Doctor Strange did not waste time. He used the Eye of Agamotto, which holds the Time Stone, the fifth Infinity Stone, to calculate the odds of winning the war. He picked $n$ actions the Avengers can take and $q$ actions whose feasibility he needs to check. Each action is labeled with a number that uniquely identifies it. The Avengers' actions are $a_1, a_2, \ldots, a_n$, and the actions to check are $b_1, b_2, \ldots, b_q$.

The magician knows that the timeline works as follows. If action $x$ and action $y$ can be performed, then actions $x \lor y$ and $x \land y$ can also be performed, where $\lor$ and $\land$ are bitwise OR and bitwise AND. For each $b_1, b_2, \ldots, b_q$, decide whether it can be obtained this way. Help Strange, since Thanos will arrive on Titan soon. Any action can be performed any number of times.

The first line contains $n$, the number of actions the Avengers can perform ($1 \le n \le 100000$).

The next line contains $n$ integers $a_i$, the numbers describing these actions ($0 \le a_i \le 10^9$). All numbers are pairwise distinct.

The third line contains $q$, the number of actions to check ($1 \le q \le 100000$).

The last line contains $q$ integers $b_j$, the numbers describing these actions ($0 \le b_j \le 10^9$).

On the $i$-th line, print YES if the action described by $b_i$ can be performed, and NO otherwise.

The numbers $1$, $3$, and $4$ can be obtained without using $\lor$ and $\land$, and $5 = 4 \lor 1$.