#include<cstdio>
#define N 2000000
long long q[N];
int n,i,j,k,r[N],s[N],d[N],p[N];
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(j=k=i=1;i<n;i++)
if(k<n&&r[k+1]<=q[j])
       q[i]=r[k]+r[k+1],s[i+n]=k++,d[i+n]=k++,q[0]+=q[i];
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++,q[0]+=q[i];
else
if(q[j]<=r[k]&&r[k]<=q[j+1])
       q[i]=r[k]+q[j],s[i+n]=k++,d[i+n]=n+j++,q[0]+=q[i];
else
       q[i]=r[k]+q[j],s[i+n]=n+j++,d[i+n]=k++,q[0]+=q[i];
printf("%lld\n",q[0]);
for(i=2*n-1;i>n;)
       j=s[i],k=d[i],p[j]=p[k]=p[i]+1,q[j]=2*q[i],q[k]=q[j]+1,i=j,
       j=s[i],p[j]=p[d[i]]=p[i]+1,q[j]=2*q[i],q[d[i]]=q[j]+1,i=k;
for(i=1;i<=n;i++)
       printf("%d %lld\n",p[i],q[i]);
return 0;}