#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n);
	rep(i, n) {
		cin >> a[i];
		a[i]--;
	}
	set<int>st = { INF };
	// 門番が必須
	auto before = [&](long long n)->long long {
		auto ite = prev(st.lower_bound(n));
		return *ite;
	};
	auto after = [&](long long n)->long long {
		auto ite = st.upper_bound(n);
		return *ite;
	};
	vector<vector<int>>v;
	vector<int>root(n);
	rep(i, n) {
		auto af = after(a[i]);
		if (af == INF) {
			st.insert(a[i]);
			root[a[i]] = v.size();
			v.push_back({ i });
		}
		else {
			st.erase(af);
			st.insert(a[i]);
			root[a[i]] = root[af];
			v[root[a[i]]].push_back(i);
		}
	}
	for (auto v : v) {
		int nx = INF, ny = INF;
		for (auto e : v) {
			chmin(nx, e);
			chmin(ny, a[e]);
		}
		cout << nx + 1 << " " << ny + 1 << endl;
	}
	return 0;
}