#include <iostream>

#include <cstdio>

#include <algorithm>

#include <cstring>

#include <string>

#include <vector>

#include <map>

#include <set>

#include <queue>

#include <list>

#include <iterator>

#include <cmath>

using namespace std;

typedef long long ll;

const int maxn = ;

int n;

ll p,q,b;

ll dp[maxn][maxn];

int main(){

       scanf("%d", &n);

       for(int i=; i<=n; i++)

       {

           scanf("%lld", &dp[][i]);

       }

       for(int i=; i<=n; ++i)

       {

           for(int j=; j<=n-i+; ++j)

           {

               dp[i][j] = dp[i-][j]^dp[i-][j+];

           }

       }

       for(int i=; i<=n; i++)

       {

           for(int j=; j<=n-i+;j++)

           {

               dp[i][j] = max(dp[i][j],max(dp[i-][j],dp[i-][j+]));

           }

       }

       int q;

       scanf("%d", &q);

       for(int i=; i<=q; i++)

       {

           int x,y;

           scanf("%d%d", &x,&y);

           printf("%lld\n",dp[y-x+][x]);

       }

    return ;

}