#include <fstream>
#include <math.h>

using namespace std;


int main()
{
    ifstream f ("rmq.in");
    ofstream g ("rmq.out");

    int n, m, i, j, x, y, lim, a[20][100001];

    f >> n;

        for (i=1; i<=n; i++)
            f>>a[0][i];

        for (i=n; i>0; i--)
            for (j=1; (1<<j)<=n; j++)
                a[j][i] = min(a[j-1][i], a[j-1][i + (1<<(j-1))]);

    f >> m;

    for (i=1; i<=m; i++)
    {
        f >> x >> y;
        constanta = (int)log2(y-x+1);
        g << min(a[constanta][x], a[constanta][y - (1<<constanta)+1]) << "\n";

    }

    return 0;
}