#include<cstdlib>
#include<cstdio>
#include<iostream>
#include<cstring>
#define lch rt<<1,l,mid
#define rch rt<<1|1,mid+1,r
using namespace std;
const int maxn=1000005;
int a[maxn<<2],m,n;
void build(int,int,int);
int query(int,int,int,int,int);
int main(){
	freopen("climb.in","r",stdin);
	freopen("climb.out","w",stdout);
	scanf("%d",&n);n++;
	build(1,1,n);
	scanf("%d",&m);
	for(int i=1;i<=m;i++){
		int x,y;
		scanf("%d%d",&x,&y);
		x++;y++;
		printf("%d\n",query(1,1,n,x,y));
	}
}
void build(int rt,int l,int r){
	if(l==r){
		scanf("%d",&a[rt]);
		return;
	}
	int mid=(l+r)>>1;
	build(lch);
	build(rch);
	a[rt]=max(a[rt<<1],a[rt<<1|1]);
}
int query(int rt,int l,int r,int s,int t){
	if(l>=s&&r<=t)return a[rt];
	int mid=(l+r)>>1;
	if(t<=mid)return query(lch,s,t);
	if(s>mid)return query(rch,s,t);
	return max(query(lch,s,t),query(rch,s,t));
}