#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <climits>
#include <string>
#include <set>
#include <cmath>
#include <map>
#include <unordered_map>
#include <numeric>
#include <random>
#include <memory>
#include <chrono>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <cassert>
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x...)
#endif
//#pragma GCC optimize("Ofast")
//#define int ll



using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
#define mp make_pair
#define pb push_back
#define sz(x) int((x).size())

#ifndef LOCAL
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#else
mt19937 rng(228);
#endif

const int N = 1e6 + 7;
const int inf = INT_MAX / 2;
const ll INF = LLONG_MAX / 3;
const int MOD = 1e9 + 7;
const ld eps = 1e-6;
const string cars[] = {"🚗", "🚕", "🚙"};

struct sparse {
    private: vector < vector < pii > > a;
    private: int log;

    public: sparse(vector < int > v) {
        log = ceil(log2(sz(v)));

        a = vector < vector < pii > > (sz(v), vector < pii > (log + 1));

        for (int i = 0; i < sz(v); i++) {
            a[i][0] = { v[i], i };
        }


        for (int j = 1; j <= log; j++) {
            for (int i = sz(v) - 1; i >= 0; i--) {
                if (i + (1 << (j - 1)) < sz(a)) {
                    a[i][j] = max(a[i + (1 << (j - 1))][j - 1], a[i][j - 1]);
                }
            }
        }
    }
    public: sparse() {}

    public: pii query(int l, int r) {
        int j = log2(r - l + 1);
        //debug(j, a[l][j], a[r - (1 << j) + 1][j]);

        return max(a[l][j], a[r - (1 << j) + 1][j]);
    }
};

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    cout << fixed << setprecision(9);
    ios::sync_with_stdio(false);
    cin.tie();
    cout.tie();

    int n;
    cin >> n;

    vector < int > a(n);

    for (int& x : a) {
        cin >> x;
    }

    sparse table(a);

    int q;
    cin >> q;

    while (q--) {
        int l, r;
        cin >> l >> r;

        auto x = table.query(l - 1, r - 1);
        cout << x.first << " " << x.second + 1 << "\n";
    }

    return 0;
}