#include<iostream>

#include<stdio.h>

using namespace std;

struct ki

{

    int m,l,r;

}tree[];

int ans=-,a[];

void build(int n,int l,int r)

{

    tree[n].l=l;

    tree[n].r=r;

    if(l==r)

    {

        tree[n].m=a[l];return;

    }

    else

    {

        build(n*,l,(l+r)/);

        build(n*+,(l+r)/+,r);

        tree[n].m=tree[n*].m>tree[n*+].m?tree[n*].m:tree[n*+].m;

    }

}

void find(int n,int a,int b)

{

    if(a<=tree[n].l&&b>=tree[n].r) ans=tree[n].m>ans?tree[n].m:ans;//注意a，b，r，l的关系！！！

    else if(a>tree[n].r||b<tree[n].l) return;

    else

    {

        find(n*,a,b);

        find(n*+,a,b);

    }

}

int main()

{

    int n,m,i,j,r,l;

    scanf("%d",&n);

    for(i=;i<=n;i++) scanf("%d",&a[i]);

    build(,,n);

    scanf("%d",&m);

    while(m--)

    {

        scanf("%d%d",&l,&r);

        ans=-;

        l++;r++;

        find(,l,r);

        printf("%d\n",ans);

    }

}