For an array $b$ of length $m$ we define the function $f$ as  $ f(b) = \begin{cases} b[1] & \quad \text{if } m = 1 \\ f(b[1] \oplus b[2],b[2] \oplus b[3],\dots,b[m-1] \oplus b[m]) & \quad \text{otherwise,} \end{cases} $ 

where $\oplus$ is bitwise exclusive OR.

For example, $f(1,2,4,8)=f(1\oplus2,2\oplus4,4\oplus8)=f(3,6,12)=f(3\oplus6,6\oplus12)=f(5,10)=f(5\oplus10)=f(15)=15$

You are given an array $a$ and a few queries. Each query is represented as two integers $l$ and $r$. The answer is the maximum value of $f$ on all continuous subsegments of the array $a_l, a_{l+1}, \ldots, a_r$.


-----Input-----

The first line contains a single integer $n$ ($1 \le n \le 5000$) — the length of $a$.

The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($0 \le a_i \le 2^{30}-1$) — the elements of the array.

The third line contains a single integer $q$ ($1 \le q \le 100\,000$) — the number of queries.

Each of the next $q$ lines contains a query represented as two integers $l$, $r$ ($1 \le l \le r \le n$).


-----Output-----

Print $q$ lines — the answers for the queries.


-----Examples-----
Input
3
8 4 1
2
2 3
1 2

Output
5
12

Input
6
1 2 4 8 16 32
4
1 6
2 5
3 4
1 2

Output
60
30
12
3



-----Note-----

In first sample in both queries the maximum value of the function is reached on the subsegment that is equal to the whole segment.

In second sample, optimal segment for first query are $[3,6]$, for second query — $[2,5]$, for third — $[3,4]$, for fourth — $[1,2]$.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = '# import os, sys, atexit\n# from io import BytesIO, StringIO\nfrom sys import stdin, stdout\n \n# input = BytesIO(os.read(0, os.fstat(0).st_size)).readline\n# _OUTPUT_BUFFER = StringIO()\n# sys.stdout = _OUTPUT_BUFFER\n \n# @atexit.register\n# def write():\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\n\ndef calculate(array):\n    n = len(array)\n    finalarray = []\n    finalarray.append(array)\n    finalarray.append([])\n    while (n!=1):\n        for x in range(n-1):\n            finalarray[-1].append(finalarray[-2][x]^finalarray[-2][x+1])\n        finalarray.append([])\n        n-=1\n    return finalarray\n    \ndef solve():\n    n = int(input())\n    array = [0]\n    array.extend(list(map(int,stdin.readline().strip().split())))\n    subArrays = []\n    for x in range(n+1):\n        subArrays.append([0]*(n+1))\n    finalarray = calculate(array)\n    # print (finalarray,len(finalarray))\n    for x in range(1,n+1):\n        for y in range(x,n+1):\n            # print (y-x+1,x,finalarray[y-x+1])\n            value = finalarray[y-x][x]\n            subArrays[1][y] = max(subArrays[1][y],value)\n            subArrays[x][y] = max(subArrays[x][y],value)\n    # print (subArrays)\n    for x in range(1,n+1):\n        for y in range(2,n+1):\n            subArrays[x][y] = max(subArrays[x][y],subArrays[x][y-1])\n    # print (subArrays)\n    for y in range(1,n+1):\n        for x in range(n-1,0,-1):\n            subArrays[x][y] = max(subArrays[x][y],subArrays[x+1][y])\n    # print (subArrays)\n    q = int(input())\n    for _ in range(q):\n        l, r = list(map(int,stdin.readline().strip().split()))\n        print(subArrays[l][r])\ntry:\n    solve()\nexcept Exception as e:\n    print (e)\n\n# solve()\t\t\t\t\t \t  \t \t \t\t\t\t  \t\t\t\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14807