#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

const int SIZE = 100000;
const int LOG = 17;
pair<int, int> sparse[LOG][SIZE];
int logs[SIZE + 1];

pair<int, int> askmax(int l, int r) {
	int level = logs[r - l + 1];
	return max(sparse[level][l], sparse[level][r - (1 << level) + 1]);
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	vector<int>a(n);
	logs[0] = logs[1] = 0;
	for (int i = 2; i <= n; i++) {
		logs[i] = logs[i / 2] + 1;
	}
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		sparse[0][i] = { a[i], i };
	}
	for (int level = 1; (1 << level) <= n; level++) {
		for (int i = 0; i + (1 << level) <= n; i++) {
			sparse[level][i] = max(sparse[level - 1][i], sparse[level - 1][i + (1 << (level - 1))]);
		}
	}
	int m, l, r;
	cin >> m;
	for (int i = 0; i < m; i++) {
		cin >> l >> r;
		cout << askmax(l - 1, r - 1).first << " " << askmax(l - 1, r - 1).second + 1 << endl;
	}
}