#include <bits/stdc++.h>
using namespace std;
#include <atcoder/segtree>
using namespace atcoder;
// using mint = modint998244353;
using ll = long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);
int op(int a, int b){ return max(a,b); }
int e(){ return 0; }
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    segtree<int,op,e> seg(n);
    vector<pair<int,int>> a(n);
    rep(i,n) cin >> a[i].first, a[i].second = i+1;
    sort(all(a));
    vector<pair<int,int>> ans(n,{INF,INF});
    rep(i,n){
        int x = seg.prod(0,a[i].second);
        chmin(ans[x].first, a[i].second);
        chmin(ans[x].second, a[i].first);
        seg.set(a[i].second-1, x+1);
    }
    for(auto [p,q]:ans){
        if(p==INF) break;
        cout << p << " " << q << '\n';
    }
    return 0;
}