#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)

template<typename T> bool chmax(T& a, T b) { return a<b ? a=b, true : false; }
template<typename T> bool chmin(T& a, T b) { return a>b ? a=b, true : false; }
using ll=long long; const int INF=1e9+10; const ll INFL=4e18;
using VI=vector<int>; using VVI=vector<VI>; using VL=vector<ll>; using VVL=vector<VL>;
using PL=pair<ll,ll>; using VP=vector<PL>; using WG=vector<vector<pair<int,ll>>>;

#ifdef LOCAL
#include "./debug.hpp"
#else
#define debug(...)
#define print_line
#endif


//----------------------------------------------------------

void solve() {
    int N; cin>>N;
    VI P(N); REP(i,N) cin>>P[i], P[i]--;

    VI dp(N,INF), memo(N);
    REP(i,N) {
        int id=lower_bound(ALL(dp),P[i])-dp.begin();
        memo[i]=id;
        dp[id]=P[i];
    }

    VVI inv(N);
    REP(i,N) inv[memo[i]].push_back(i);

    REP(i,N) {
        if(inv[i].size()==0) break;
        cout<<inv[i][0]+1<<' '<<P[inv[i].back()]+1<<'\n';
    }
}

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    //cout<<fixed<<setprecision(15);
    int T=1; //cin>>T;
    while(T--) solve();
}