#include <bits/stdc++.h>

using namespace std;
using ll = long long;
constexpr int INF = (1u << 31) - 1;

int main() {
  int N;
  cin >> N;
  vector<int> P(N);
  for (auto&& p : P)
    cin >> p, p--;
  // set<int> used;
  vector<int> table(N);
  map<int, int> P2;
  for (int i = 0; i < N; i++)
    P2[i] = P[i];
  for (int i = 0; i < N; i++)
    table[P[i]] = i;
  vector<int> ans;
  for (int i = 0; i < N; i++) {
    // cout << i + 1 << ":start" << endl;
    // for (auto [a, b] : P2)
    //   cout << "[" << a + 1 << "," << b + 1 << "]" << endl;
    // iを使えるなら使う
    // id:=Pのi
    int id = table[i];
    // if (used.contains(id)) continue;
    auto itr = P2.lower_bound(id);
    // if (i == 2) cout << itr->second + 1 << "," << id + 1 << endl;
    if ((*itr).first != id) continue;
    auto itr2 = itr;
    if (++itr2 == P2.end()) continue;
    ans.push_back(itr->second);
    ans.push_back(itr2->second);
    P2.erase(itr);
    P2.erase(P2.upper_bound(id));
  }
  // cout << ans.size() << endl;
  for (int i = 0; i < N; i++) {
    cout << ans[i] + 1 << " \n"[i + 1 == N];
  }
}