#include<iostream>
#include<cstdio>
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
int tree[4000010];
void Build(int,int,int);
int Find(int,int,int,int,int);
int main()
{
	freopen("climb.in","r",stdin);
	freopen("climb.out","w",stdout);
	int N;
	cin>>N;
	Build(1,0,N);
	int Q;
	cin>>Q;
	int Ai,Bi;
	for(int i=1;i<=Q;i++)
	{
		cin>>Ai>>Bi;
		int k=Find(Ai,Bi,1,0,N);
		cout<<k<<endl;
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}
void Build(int rt,int l,int r)
{
	if(r<l)return;
	if(r==l){
		cin>>tree[rt];return;
	}
	int mid=(l+r)>>1;
	Build(lson);
	Build(rson);
	if(tree[rt<<1]>=tree[rt<<1|1])tree[rt]=tree[rt<<1];
	else tree[rt]=tree[rt<<1|1];
}
int Find(int s,int t,int rt,int l,int r)
{
	if(s<=l&&t>=r)return tree[rt];
	int mid=(l+r)>>1;
	if(t<=mid)return Find(s,t,lson);
	if(s>mid)return Find(s,t,rson);
	return Find(s,t,lson)>Find(s,t,rson)? Find(s,t,lson):Find(s,t,rson);
}