#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
/*
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};
*/
const ll INFL = 1LL << 60;//10^18 = 2^60
const int INF = 1 << 30;//10^9
ll MOD = 1000000007;
//ll MOD = 998244353;

vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};

//デバッグ
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}
ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){return x / gcd(x, y) * y;};

ll kai_mod(ll x){
  if(x == 0) return 1;
  return x * kai_mod(x-1) % MOD;
}

/*
//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}
*/


const ll N_ = (1 << 18);
ll segOdd[2*N_-1];
//Range Minimum Query
void updateOdd(ll k, ll x){
  k += N_-1;
  segOdd[k] = x;
  while(k > 0){
    k = (k-1)/2;
    segOdd[k] = min(segOdd[2*k+1], segOdd[2*k+2]);
  }
}

ll queryOdd(ll x = 0, ll y = 0, ll k = 0, ll left = 0, ll right = N_){
  if(right <= x || y <= left) return INFL;
  if(x <= left && right <= y) return segOdd[k];
  ll mid = (left + right) / 2;
  ll l = queryOdd(x, y, 2*k+1, left, mid);
  ll r = queryOdd(x, y, 2*k+2, mid, right);
  return min(l, r);
}

ll segEven[2*N_-1];
//Range Minimum Query
void updateEven(ll k, ll x){
  k += N_-1;
  segEven[k] = x;
  while(k > 0){
    k = (k-1)/2;
    segEven[k] = min(segEven[2*k+1], segEven[2*k+2]);
  }
}

ll queryEven(ll x, ll y, ll k = 0, ll left = 0, ll right = N_){
  if(right <= x || y <= left) return INFL;
  if(x <= left && right <= y) return segEven[k];
  ll mid = (left + right) / 2;
  ll l = queryEven(x, y, 2*k+1, left, mid);
  ll r = queryEven(x, y, 2*k+2, mid, right);
  return min(l, r);
}

ll N;
vector<ll> p, q;
vector<ll> ans;
void saiki(ll start, ll M){
  typedef pair<ll, pair<ll, ll>> P;
  priority_queue<P, vector<P>, greater<P>> pque;
  pque.push({queryEven(0, M), {0, M}});
  while(!pque.empty()){
    P pq = pque.top();
    pque.pop();
    if(pq.s.s == 0){
      continue;
    }
    if(pq.s.s == 2){
      ans.pb(p[pq.s.f]);
      ans.pb(p[pq.s.f+1]);
      continue;
    }
    ll x, y, x_pos, y_pos;
    ll start = pq.s.f;
    ll n = pq.s.s;
    if(start % 2){
      x = queryOdd(start, start + n);
      x_pos = q[x];
      y = queryEven(x_pos+1, start + n);
      y_pos = q[y];
    }else{
      x = queryEven(start, start + n);
      x_pos = q[x];
      y = queryOdd(x_pos+1, start + n);
      y_pos = q[y];
    }
    ans.pb(x);
    ans.pb(y);
    if(start % 2){
      pque.push({queryOdd(start, x_pos), {start, x_pos-start}});
    }else{
      pque.push({queryEven(start, x_pos), {start, x_pos-start}});
    }
    if((x_pos+1) % 2){
      pque.push({queryOdd(x_pos+1, y_pos), {x_pos+1, y_pos-x_pos-1}});
    }else{
      pque.push({queryEven(x_pos+1, y_pos), {x_pos+1, y_pos-x_pos-1}});
    }
    if((y_pos+1) % 2){
      pque.push({queryOdd(y_pos+1, n+start), {y_pos+1, n-y_pos+start-1}});
    }else{
      pque.push({queryEven(y_pos+1, n+start), {y_pos+1, n-y_pos+start-1}});
    }
  }
  rep(i, N){
    cout << ans[i] + 1;
    if(i == N-1) cout << endl;
    else cout << " ";
  }
  return;
}

void solve(){
  rep(i, N){
    updateEven(i, INFL);
    updateOdd(i, INFL);
    if(i % 2) updateOdd(i, p[i]);
    else updateEven(i, p[i]);
  }
  saiki(0, N);
}

int main(){
  cin >> N;
  p.resize(N);
  q.resize(N);
  rep(i, N){
    cin >> p[i];
    p[i]--;
    q[p[i]] = i;
  }
  solve();
}


Measured memory_bytes: 21420