#include<cmath>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=1000005;
int Max[maxn][30],a[maxn],q,n;
void Init();
void Rmq_Init();
int Rmq_max(int,int);
int Rmq_min(int,int);
int main(){
	freopen("climb.in","r",stdin);
	freopen("climb.out","w",stdout);
	Init();
	return 0;
}
void Init(){
	scanf("%d",&n);
	for(int i=1;i<=n+1;i++){
		scanf("%d",&a[i]);
		Max[i][0]=a[i];
	}
	Rmq_Init();
	scanf("%d",&q);
	for(int i=1;i<=q;i++){
		int x,y;
		scanf("%d%d",&x,&y);
		printf("%d\n",Rmq_max(x+1,y+1));                                                                      
	}
}
void Rmq_Init(){
	int m=log(n*1.0)/log(2.0);
	for(int j=1;j<=m;j++){
		for(int i=1;i<=n;i++){
			int k=1<<(j-1);
			Max[i][j]=Max[i][j-1];
			if(i+k<=n)Max[i][j]=max(Max[i][j],Max[i+k][j-1]);
		}
	}
}
int Rmq_max(int s,int t){
	int m=log((t-s+1)*1.0)/log(2.0);
	int k=1<<m;
	return max(Max[s][m],Max[t-k+1][m]);
}