//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
 
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

bool all0eg( int v){
    return v >= 0;
}


int main(){
    int N,tar;
    tar = 0;
    cin >> N;
    vector< pair<int,int> > seq(N, make_pair(0,0) );
    int count = 0;
    EACH(iter,seq){
        int val;
        cin >> val;
        *iter = make_pair(val, count);
        count++;
    }

    bool eg = true;
    EACH(iter,seq){
        if(iter->first < 0){ eg = false; break;}
    }
    bool lt = true;
    EACH(iter,seq){
        if(iter->first >= 0){ lt = false; break;}
    }
    if(eg){
        cout << N-1 << endl;
        REP(i,N-1){
            cout << i+1 << " " << i+2 << endl;
        }
        return 0;
    }else if(lt){
        cout << N-1 << endl;
        for(auto i = N; i > 1; i--){
            cout << i << " " << i-1 << endl;
        }               
        return 0;        
    }else{
        count = 0;
        auto maxE = max_element(seq.begin(), seq.end());
        auto minE = min_element(seq.begin(), seq.end());
        cout << 2*N-2 << endl;
        if( abs(maxE->first) >= abs(minE->first) ){
            EACH(iter,seq){
                if( iter != maxE )
                cout << maxE->second + 1 << " " << iter->second+1 << endl;
            }
            REP(i,N-1){
                cout << i+1 << " " << i+2 << endl;
            }
        }else{
            EACH(iter,seq){
                if ( iter != minE )
                cout << minE->second + 1 << " " << iter->second+1 << endl;
            }
            for(auto i = N; i > 1; i--){
                cout << i << " " << i-1 << endl;
            }               
        }
    }
}





Measured memory_bytes: 256