Problem: It's Petya's birthday party and his friends have presented him a brand new "Electrician-n" construction set, which they are sure he will enjoy as he always does with weird puzzles they give him.

Construction set "Electrician-n" consists of 2n - 1 wires and 2n light bulbs. Each bulb has its own unique index that is an integer from 1 to 2n, while all wires look the same and are indistinguishable. In order to complete this construction set one has to use each of the wires to connect two distinct bulbs. We define a chain in a completed construction set as a sequence of distinct bulbs of length at least two, such that every two consecutive bulbs in this sequence are directly connected by a wire. Completed construction set configuration is said to be correct if a resulting network of bulbs and wires has a tree structure, i.e. any two distinct bulbs are the endpoints of some chain.

Petya was assembling different configurations for several days, and he noticed that sometimes some of the bulbs turn on. After a series of experiments he came up with a conclusion that bulbs indexed 2i and 2i - 1 turn on if the chain connecting them consists of exactly d_i wires. Moreover, the following important condition holds: the value of d_i is never greater than n.

Petya did his best but was not able to find a configuration that makes all bulbs to turn on, so he seeks your assistance. Please, find out a configuration that makes all bulbs shine. It is guaranteed that such configuration always exists.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the parameter of a construction set that defines the number of bulbs and the number of wires.

Next line contains n integers d_1, d_2, …, d_n (1 ≤ d_i ≤ n), where d_i stands for the number of wires the chain between bulbs 2i and 2i - 1 should consist of.

Output

Print 2n - 1 lines. The i-th of them should contain two distinct integers a_i and b_i (1 ≤ a_i, b_i ≤ 2n, a_i ≠ b_i) — indices of bulbs connected by a wire.

If there are several possible valid answer you can print any of them.

Examples

Input


3
2 2 2


Output


1 6
2 6
3 5
3 6
4 5


Input


4
2 2 2 1


Output


1 6
1 7
2 6
3 5
3 6
4 5
7 8


Input


6
2 2 2 2 2 2


Output


1 3
2 3
3 5
4 5
5 7
6 7
7 12
8 12
9 11
9 12
10 11


Input


2
1 1


Output


1 2
1 4
3 4

Note

<image> Answer for the first sample test.  <image> Answer for the second sample test. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct S {
  int a, b;
  S() {}
  S(int _a, int _b) {
    a = _a;
    b = _b;
  }
  const bool operator<(const S &o) const { return a < o.a; }
};
string exm;
inline void exf(void) {
  cout << exm << "\n";
  exit(0);
}
template <typename T>
inline void showAll(vector<T> &v, string sep = "") {
  for (T &here : v) cout << here << sep;
}
template <typename T>
inline void showAll(T arr[], int st, int end, string sep = "") {
  for (int i = st; i <= end; i++) cout << arr[i] << sep;
}
template <typename T>
inline vector<int> int_seperation(T N, int d = 10) {
  vector<int> v;
  while (N) {
    v.push_back(N % d);
    N /= d;
  }
  reverse(v.begin(), v.end());
  return v;
}
const int SIZE = 200009;
int level[SIZE], rev[SIZE], orig[SIZE];
pair<int, int> arr[SIZE];
vector<int> tree[SIZE];
void dfs(int node, int p) {
  for (int &next : tree[node]) {
    if (p == next) continue;
    printf("%d %d\n", node, next);
    dfs(next, node);
  }
}
void level_dfs(int node, int p, int l) {
  level[node] = l;
  rev[l] = node;
  for (int &next : tree[node]) {
    if (p == next) continue;
    level_dfs(next, node, l + 1);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  queue<int> unused;
  for (int i = 1; i <= n; i++) {
    int inp;
    scanf("%d", &inp);
    orig[i] = inp;
    arr[i] = {inp, i};
  }
  sort(arr + 1, arr + 1 + n);
  reverse(arr + 1, arr + 1 + n);
  int idx = arr[1].second;
  int last = idx * 2 - 1;
  for (int i = 1; i <= n; i++) {
    unused.push(arr[i].second * 2 - 1);
  }
  unused.pop();
  while (!unused.empty()) {
    int cur = unused.front();
    unused.pop();
    tree[last].push_back(cur);
    tree[cur].push_back(last);
    last = cur;
  }
  level_dfs(idx * 2 - 1, -1, 0);
  for (int i = 1; i <= n; i++) {
    int j = arr[i].second * 2 - 1;
    int cur_level = level[j];
    int find = cur_level + orig[j / 2 + 1] - 1;
    if (find == level[last]) {
      rev[find + 1] = j + 1;
      level[j + 1] = find + 1;
      tree[last].push_back(j + 1);
      tree[j + 1].push_back(last);
      last = j + 1;
      continue;
    }
    int k = rev[find];
    tree[j + 1].push_back(k);
    tree[k].push_back(j + 1);
  }
  dfs(idx * 2 - 1, -1);
  return 0;
}