#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define bitcount(x)  __builtin_popcount(x)
#define bitcountll(x)  __builtin_popcountll(x)
// Input
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define inp(p) in2(p.F,p.S)
#define llin(a) cin >> a
#define inl(a) scanf("%lld",&a)
#define read(v,i,n) for(i=0;i<n;i++)in(v[i])
#define twod(mat,i,j,n,m) rep(i,n){rep(j,m)in(mat[i][j]);}
#define sc(ch) scanf("%c",&ch)
#define sstr(str) scanf("%s",str)
// Output
#define pr(a) printf("%d ",a)
#define pr2(a,b) printf("%d %d\n",a,b)
#define pr3(a,b,c) printf("%d %d %d\n",a,b,c)
#define prp(p) pr2(p.F,p.S)
#define out(a) printf("%d\n",a)
#define outl(a) printf("%lld\n",a)
#define llpr(a) cout << a << " "
#define llout(a) cout << a << "\n"
#define pinttwod(mat,i,j,n,m) rep(i,n){rep(j,m)pr(mat[i][j]);   lin;}
#define plltwod(mat,i,j,n,m)  rep(i,n){rep(j,m)llpr(mat[i][j]); lin;}
#define byes printf("YES\n")
#define bno printf("NO\n")
#define yes printf("Yes\n")
#define no printf("No\n")
#define lin printf("\n")
// Iterator
#define rep(i,n) for(i=0;i<n;++i)
#define fone(i,n) for(i=1;i<=n;++i)
#define rrep(i,n) for(i=n-1;i>=0;--i)
#define lp(i,a,b) for(i=a;i<b;++i)
#define rlp(i,a,b) for(i=a;i>=b;--i)
#define all(vec) vec.begin(),vec.end()
#define lower(v,k) lower_bound(v.begin(),v.end(),k)-v.begin()
#define upper(v,k) upper_bound(v.begin(),v.end(),k)-v.begin()
#define tf(mytuple) get<0>(mytuple)
#define ts(mytuple) get<1>(mytuple)
#define tt(mytuple) get<2>(mytuple)
// function
#define sz(x) x.size()
#define inrange(i,a,b) (i>=a && i<=b)
#define FLUSH fflush(stdout)
#define precision(x) cout << setprecision(x) << fixed
#define remax(a,b) a=max(a,b)
#define remin(a,b) a=min(a,b)
#define lchild(p) 2*p
#define rchild(p) 2*p+1
#define lseg l,m,2*p
#define rseg m+1,h,2*p+1
#define bhardo(mat,i,j,n,m,t) rep(i,n){rep(j,m)mat[i][j]=t;}
#define biton(mask,i)  (mask&(1<<i))
#define bitoff(mask,i) (!(mask&(1<<i)))
// Debug
#define dbg(v,i,n) for(i=0;i<n;i++)pr(v[i]); lin
#define ck printf("continue\n")
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
	cerr << *it << " = " << a << "\n";
	err(++it, args...);
}
// Data Type
#define ll long long int
#define ii pair<int,int>
#define pli pair<ll,int>
#define triple tuple<int,int,int>
#define vi vector<int>
#define vii vector<pair<int,int> >
#define vvi vector<vector<int> >
#define viii vector<pair<pair<int,int>,int> >
#define vvii vector<vector<pair<int,int> > >
// Constant
const double PI = acos(-1);
const double eps = (1e-9);
const ll INF = 1e15;
const int M = (1e9)+7;
const int N = (2e5)+5;  // check the limit, man
const int K = 20;
int perm[N];
struct rmqindex
{
    int po[K],ar[2*N];
    int sp[N][K];
    int v[N];
    rmqindex()
    {
        int i,k;
        ar[1]=0,k=1,po[0]=1;
        while(k<N)
        {
            for(i=k+1;i<2*k;i++)
                ar[i]=ar[k];
            ar[2*k]=1+ar[k],k*=2;
        }
        for(i=1;i<K;i++)
            po[i]=2*po[i-1];
    }
    int operation(int a,int b) // check the operation
    {
        return v[a]<v[b]?a:b;
    }
    void build(vi &val,int n)
    {
        int i,k;
        rrep(i,n)
        {
            v[i]=val[i],sp[i][0]=i;
            for(k=1;i+po[k]<=n;k++)
                sp[i][k]=operation(sp[i][k-1],sp[i+po[k-1]][k-1]);
        }
    }
    int query(int a,int b)
    {
        int y,x=b-a+1;
        y=ar[x],x-=po[y];
        return operation(sp[a][y],sp[a+x][y]);
    }
};
rmqindex rmq[2];
ii call(int l,int r)
{
    int f=(l&1);
    int p=rmq[f].query(l,r);
    int q=rmq[f^1].query(p,r);
    return {p,q};
}
int value(int l,int r)
{
    if(l>r)
        return M;
    ii temp=call(l,r);
    return perm[temp.F];
}
triple make(int l,int r)
{
    return mt(value(l,r),l,r);
}
void pre(int f,int n)
{
    vi v(n,M);
    int i;
    for(i=f;i<n;i+=2)
        v[i]=perm[i];
    rmq[f].build(v,n);
}
void solve()
{
    int n,m,i,l,r,a,b;
    in(n);
    read(perm,i,n);
    pre(0,n);
    pre(1,n);
    vi ans;
    set<triple> st;
    triple temp;
    st.insert(make(0,n-1));
    while(sz(st)>0)
    {
        temp=(*st.begin());
        st.erase(temp);
        tie(ignore,l,r)=temp;
        if(l>r)
            continue;
        tie(a,b)=call(l,r);
        ans.pb(perm[a]);
        ans.pb(perm[b]);
        st.insert(make(l,a-1));
        st.insert(make(a+1,b-1));
        st.insert(make(b+1,r));
    }
    dbg(ans,i,n);
}
int main()
{
    int t=1;
//    in(t);
    while(t--)
        solve();
}










Measured memory_bytes: 50932