#include<cstdio>
#define N 2000000
long long q[N];
int n,i,j,k,r[N],s[N],d[N],p[N];

void A(int i,long long c,int e)
{if(i>n)
       A(s[i],2*c,e+1),A(d[i],2*c+1,e+1);
else
       p[i]=e,q[i]=c;}

int main()
{freopen("huffman.in","r",stdin);
freopen("huffman.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
       scanf("%d",&r[i]),q[i]=N;
for(k=j=i=1;i<n;q[0]+=q[i++])
if(k<n&&r[k+1]<=q[j])
       q[i]=r[k]+r[k+1],s[i+n]=k++,d[i+n]=k++;
else
if(q[j+1]<=r[k]||k>n)
       q[i]=q[j]+q[j+1],s[i+n]=n+j++,d[i+n]=n+j++;
else
       q[i]=r[k]+q[j],s[i+n]=k++,d[i+n]=n+j++;
printf("%lld\n",q[0]),A(2*n-1,0,0);
for(i=1;i<=n;i++)
       printf("%d %lld\n",p[i],q[i]);
return 0;}