#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6;
const long long INF = 1e18;

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

queue <int> q1;
queue <int> q2;


struct Node {
  long long val;
  int leftChild;
  int rightChild;
};
int nrNodes, n;

Node nodes[2*MAXN+2];

long long ans = 0;
pair <int, long long> rez[MAXN+1];

void dfs( int node, int level, long long nr ) {
  if( node > n )
    ans += nodes[node].val;
  else
    rez[node] = { level - 1, nr };
  if( nodes[node].leftChild )
    dfs( nodes[node].leftChild, level + 1, 2 * nr );
  if( nodes[node].rightChild )
    dfs( nodes[node].rightChild, level + 1, 2 * nr + 1 );
}
int main() {
  int i, index1, index2;
  long long sum, a, b;
  fin >> n;
  for( i = 1; i <= n; i++ ) {
    fin >> nodes[i].val;
    q1.push( i );
  }
  nodes[0].val = INF;
  nrNodes = n + 1;
  while( q1.size() + q2.size() > 1 ) {
    /*sum = q.front().first;
    a = q.front().second;
    q.pop();
    sum += q.front().first;
    b = q.front().second;
    q.pop();
    q.push( { sum, nrNodes } );
    nodes[nrNodes++] = { sum, a, b, false }; */
    sum = 0;
    if( !q1.empty() )
      a = q1.front();
    else a = 0;
    if( !q2.empty() )
      b = q2.front();
    else b = 0;
    if( nodes[a].val < nodes[b].val ) {
      index1 = q1.front();
      q1.pop();
      sum += nodes[a].val;
    }
    else {
      index1 = q2.front();
      q2.pop();
      sum += nodes[b].val;
    }

    if( !q1.empty() )
      a = q1.front();
    else a = 0;
    if( !q2.empty() )
      b = q2.front();
    else b = 0;
    if( nodes[a].val < nodes[b].val ) {
      index2 = q1.front();
      q1.pop();
      sum += nodes[a].val;
    }
    else {
      index2 = q2.front();
      q2.pop();
      sum += nodes[b].val;
    }

    q2.push( nrNodes );
    nodes[nrNodes++] = { sum, index1, index2 };
  }
  nrNodes--;
  dfs( nrNodes, 1, 0 );
  fout << ans << "\n";
  for( i = 1; i <= n; i++ )
    fout << rez[i].first << " " << rez[i].second << "\n";
  return 0;
}