#include<cstdio>
#include<vector>
#include<iostream>
#include<algorithm> 
using namespace std;
int n;
vector <int> d;
int a[1000001][21];
int main(){
	freopen("climb.in","r",stdin);
	freopen("climb.out","w",stdout);
	scanf("%d",&n);
	int x;
	n++;
	for(int i=1;i<=n;i++){
		scanf("%d",&x);
		d.push_back(x);
	}
	for(int i=0;i<d.size();i++)
		a[i][0]=d[i];
	for(int j=1;(1<<j)<=n;j++)
		for(int i=0;i+(1<<j)-1<=n;i++)
			a[i][j]=max(a[i][j-1],a[i+(1<<(j-1))][j-1]);
	int q;
	scanf("%d",&q);
	int l,r;
	for(int i=1;i<=q;i++){
		scanf("%d%d",&l,&r);
		int k=0;
		while((1<<(k+1))<=r-l+1)
			k++;
		printf("%d\n",max(a[l][k],a[r-(1<<k)+1][k]));
	}
	return 0;
}