Range Minimum SQRT

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int*A){F(N)scanf("%d",A+i);}
#define MX (1<<17)
#define BS (333)
int N,a,b,T[MX/BS+1],A[MX];
void ini(){F(N)T[i/BS]=min(A[i],T[i/BS]);}
ll qr(int b,int e){
    int S=INF;
    while(b<e&&b/BS==(b-1)/BS)S=min(S,A[b++]);
    while(b<e&&e/BS==(e-1)/BS)S=min(S,A[--e]);
    while(b<e)S=min(T[b/BS],S),b+=BS;
    return S;
}
int main(void){
    scanf("%d",&N),ga(N,A),CL(T,63),ini();
    IN(Q)FF(Q)scanf("%d%d",&a,&b),printf("%lld\n",qr(a,b+1));
    return 0;
}