#include <bits/stdc++.h>

using namespace std;
using int64 = long long;

ifstream fin("huffman.in");
ofstream fout("huffman.out");

struct node {
  node *st, *dr;
  int ind;
  int64 wt;
};

const int NMAX = 1e6 + 6;
int N, lg[NMAX];
int64 sol[NMAX], ans;
deque<node*> Q1, Q2;

void read_input() {
  fin >> N;
  for (int i = 1; i <= N; ++i) {
    node *p = new node;
    fin >> p->wt;
    p->ind = i;
    p->st = p->dr = nullptr;
    Q1.push_back(p);
  }
}

node* take_best() {
  node *ans;
  if (Q2.empty()) {
    ans = Q1.front();
    Q1.pop_front();
  } else {
    if (Q1.empty()) {
      ans = Q2.front();
      Q2.pop_front();
    } else {
      int64 wt1 = Q1.front()->wt, wt2 = Q2.front()->wt;
      if (wt1 < wt2) {
        ans = Q1.front();
        Q1.pop_front();
      } else {
        ans = Q2.front();
        Q2.pop_front();
      }
    }
  }
  return ans;
}

void dfs(node *u, int64 mask, int depth) {
  if (u->ind > 0) {
    sol[u->ind] = mask;
    lg[u->ind] = depth;
    ans += u->wt * depth;
    return;
  }
  if (u->st)
    dfs(u->st, mask << 1LL, depth + 1);
  if (u->dr)
    dfs(u->dr, mask << 1LL | 1LL, depth + 1);
}

void solve() {
  while (Q1.size() + Q2.size() > 1) {
    node *lSon = take_best(), *rSon = take_best();
    node *parent = new node;
    parent->wt = lSon->wt + rSon->wt;
    parent->ind = 0;
    parent->st = lSon;
    parent->dr = rSon;
    Q2.push_back(parent);
  }
  node *root = Q2.front();
  dfs(root, 0, 0);
  fout << ans << '\n';
  for (int i = 1; i <= N; ++i)
    fout << lg[i] << ' ' << sol[i] << '\n';
}

void close_files() {
  fin.close();
  fout.close();
}

int main() {
  read_input();
  solve();
  close_files();
  return 0;
}