Ivan and Burgers（CF-1100F）
Problem Description
Ivan loves burgers and spending money. There are nn burger joints on the street where Ivan lives. Ivan has qq friends, and the ii-th friend suggested to meet at the joint liliand walk to the joint riri (li≤ri)(li≤ri). While strolling with the ii-th friend Ivan can visit all joints x which satisfy li≤x≤ri.
For each joint Ivan knows the cost of the most expensive burger in it, it costs ciciburles. Ivan wants to visit some subset of joints on his way, in each of them he will buy the most expensive burger and spend the most money. But there is a small issue: his card broke and instead of charging him for purchases, the amount of money on it changes as follows.
If Ivan had dd burles before the purchase and he spent cc burles at the joint, then after the purchase he would have d⊕c burles, where ⊕ denotes the bitwise XOR operation.
Currently Ivan has 2^(2^100)−1 burles and he wants to go out for a walk. Help him to determine the maximal amount of burles he can spend if he goes for a walk with the friend i. The amount of burles he spends is defined as the difference between the initial amount on his account and the final account.
Input
The first line contains one integer n (1≤n≤500000) — the number of burger shops.
The next line contains nn integers c1,c2,…,cn (0≤ci≤106), where cici — the cost of the most expensive burger in the burger joint i.
The third line contains one integer q (1≤q≤500000) — the number of Ivan's friends.
Each of the next qq lines contain two integers li and ri (1≤li≤ri≤n) — pairs of numbers of burger shops between which Ivan will walk.
Output
Output q lines, i-th of which containing the maximum amount of money Ivan can spend with the friend i.
Examples
Input
4
7 2 3 4
3
1 4
2 3
1 3Output
7
3
7Input
5
12 14 23 13 7
15
1 1
1 2
1 3
1 4
1 5
2 2
2 3
2 4
2 5
3 3
3 4
3 5
4 4
4 5
5 5Output
12
14
27
27
31
14
25
26
30
23
26
29
13
13
7Note
In the first test, in order to spend the maximum amount of money with the first and third friends, Ivan just needs to go into the first burger. With a second friend, Ivan just go to the third burger.
In the second test for a third friend (who is going to walk from the first to the third burger), there are only 8 options to spend money — 0, 12, 14, 23, 12⊕14=2, 14⊕23=25, 12⊕23=27, 12⊕14⊕23=20. The maximum amount of money it turns out to spend, if you go to the first and third burger — 12⊕23=27.
题意：给出长度为 n 的一个序列，再给出 m 个查询，每组查询给出 l、r 两个数，查询区间 [l,r] 中的异或和最大值
思路：查询异或和最大值可以利用线性基来做，但由于要区间查询，那么可以利用前缀线性基来做
Source Program
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include