#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
int op(int a, int b){
    return max(a, b);
}
int e(){return 0;}


int main(){
    int n; cin >> n;
    vi p(n); rep(i, n)cin >> p[i];
    rep(i, n)p[i]--;
    vi pos(n); rep(i, n)pos[p[i]] = i;

    segtree<int, op, e> seg(n);
    rep(i, n){
        int c = pos[i];
        if(c == 0){
            seg.set(c, 1);
            continue;
        }
        seg.set(c, seg.prod(0, c) + 1);
    }
    int size = seg.all_prod();

    vvi ans(size, vi(2, 1e9));
    rep(i, n){
        int u = seg.get(i) - 1;
        ans[u][0] = min(ans[u][0], i+1);
        ans[u][1] = min(ans[u][1], p[i]+1);
    }
    rep(i, size){
        cout << ans[i][0] << " " << ans[i][1] << endl;
    }

    return 0;
}