#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}



int main(){
	int n; cin >> n;
	vector<int> p(n),r(n);
	rep(i,0,n){
		cin >> p[i];
		p[i]--;
		r[p[i]] = i;
	} 
	set<int> alive;
	rep(i,0,n){
		alive.insert(i);
	}
	set<int> pr;
	rep(i,0,n) pr.insert(i);

	vector<int> q(0);
	rep(i,0,n/2){
		auto itr_pr = alive.begin();

		auto itr = pr.find(r[*itr_pr]);
		itr++;
		if (itr == pr.end()){
			itr_pr++;
			itr = pr.find(r[*itr_pr]);
		}else{
			itr--;
		}

		int tar1 = *itr;
		itr++;
		int tar2 = *itr;

		alive.erase(p[tar1]);
		alive.erase(p[tar2]);
		pr.erase(tar1);
		pr.erase(tar2);
		q.push_back(p[tar1]);
		q.push_back(p[tar2]);
	}
	rep(i,0,n){
		cout << q[i] + 1 << ' ';
	}
	cout << '\n';
}