#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define pii              pair <int,int>
#define pll              pair <long long,long long>
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cerr<<#x " = "<<(x)<<endl
#define VI               vector <int>
#define DBG              pf("Hi\n")
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf("%d",&a)
#define sfl(a)           scanf("%lld",&a)
#define sff(a,b)         scanf("%d %d",&a,&b)
#define sffl(a,b)        scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)      scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)     scanf("%lld %lld %lld",&a,&b,&c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i<n;i++)
#define loop1(i,n)       for(int i=1;i<=n;i++)
#define REP(i,a,b)       for(int i=a;i<b;i++)
#define RREP(i,a,b)      for(int i=a;i>=b;i--)
#define TEST_CASE(t)     for(int z=1;z<=t;z++)
#define PRINT_CASE       printf("Case %d: ",z)
#define LINE_PRINT_CASE  printf("Case %d:\n",z)
#define CASE_PRINT       cout<<"Case "<<z<<": "
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1<<28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))

using namespace std;

//using namespace __gnu_pbds;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/

ll ara[100];

int main()
{

//    freopen("in.txt","r",stdin);
//	  freopen("out.txt","w",stdout);
    CIN;
    // set<int>st;

    vector<pii>ans;

    int n;
    cin>>n;
    for(int i=1; i<=n; i++) cin>>ara[i];

    int maxi=*max_element(ara+1,ara+n+1);
    int mini=*min_element(ara+1,ara+n+1);

    if(maxi>0 && mini<0)
    {

        if(abs(maxi)>abs(mini))
        {
            int id=max_element(ara+1,ara+n+1)-ara;
            for(int i=1; i<=n; i++)
            {
                ara[i]+=maxi;
                ans.pb(pii(id,i));
            }
        }
        else
        {
            int id=min_element(ara+1,ara+n+1)-ara;
            for(int i=1; i<=n; i++)
            {
                ara[i]+=mini;
                ans.pb(pii(id,i));
            }
        }
    }

    maxi=*max_element(ara+1,ara+n+1);
    mini=*min_element(ara+1,ara+n+1);

    if(maxi>=0 && mini>=0)
    {
        for(int i=2; i<=n; i++)
        {
            ara[i]+=ara[i-1];
            ans.pb(pii(i-1,i));
        }
    }
    else
    {
        for(int i=n-1; i>0; i--)
        {
            ara[i]+=ara[i+1];
            ans.pb(pii(i+1,i));
        }
    }

    cout<<SZ(ans)<<endl;

    for(int i=0; i<SZ(ans); i++)
        cout<<ans[i].ff<<" "<<ans[i].ss<<endl;


    return 0;
}


Measured memory_bytes: 256