/**
	author:  shobonvip
	created: 2025.08.16 17:52:30
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int op(int a, int b) {
	return min(a, b);
}

int e() {
	return (int)1e9;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n; cin >> n;
	vector<int> p(n);
	rep(i,0,n) {
		cin >> p[i];
	}

	int v;
	auto f = [&](int x) -> bool {
		return x >= v;
	};

	segtree<int,op,e> seg(p);

	while (seg.all_prod()!=e()){
		int ansx = 1e9;
		int ansy = 1e9;
		int now = 0;
		v = e();
		while (now < n) {
			int nxt = seg.max_right(now, f);
			if (nxt == n) break;
			v = p[nxt];
			chmin(ansx, nxt);
			chmin(ansy, p[nxt]);
			seg.set(nxt, e());
		}
		cout << ansx+1 << ' '  << ansy << endl;
	}

}