SGU 138

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif

#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a)        for( int i = (a)-1 ; i >= 0 ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define SZ(a)           ((int)a.size())
#define PP(n,m,a)       puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-10;
const double pi = acos(-1.0);
const int maxn = 111;
const int maxc = 11111;

struct zz
{
    int id;
    int s;
    bool operator < (const zz& cmp) const
    {
        return s<cmp.s;
    }
}as;

vector<zz>v;
int win[maxc];
int lose[maxc];
int tid;
int n;

void make(int id)
{
    for(int i=tid;i>=1;i--)
    {
        if(lose[i]==-1)
        {
            lose[i] = id;
            tid = i-1;
            return ;
        }
    }
}

int main()
{
    cin>>n;
    int sum=0;
    int temp;
    v.clear();
    for(int i=1;i<=n;i++)
    {
        cin>>temp;
        as.id = i;
        as.s = temp;
        v.pb(as);
        sum+=temp;
    }
    sum/=2;
    sort(v.begin(),v.end());
    reverse(v.begin(),v.end());
    temp = 1;
    MM(win,-1);
    MM(lose,-1);
    for(int i=0;i<v.size();i++)
    {
        for(int u=1;u<=v[i].s-1;u++)
        {
            win[temp++] = v[i].id;
            if(temp>sum)
            {
                goto loop;
            }
        }
        lose[temp] = v[i].id;

    }
    loop:
    tid = sum ;
    temp = 1;
    int idx;
    for(int i=v.size()-1;i>=0;i--)
    {
        for(int j=1;j<=v[i].s;j++)
        {
            idx = v[i].id;
            make(idx);
            if(!tid)
            {
                goto loop2;
            }
        }
    }
    loop2:
    cout<<sum<<endl;
    for(int i=1;i<=sum;i++)
    {
        cout<<win[i]<<" "<<lose[i]<<endl;
    }
   // system("pause");
    return 0;
}