// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
const int MOD = (1000000007);
// const int MOD = (998244353);
// const int INF = (1 << 30);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; }



signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    //---------------------------------------------
    
    int n;
    cin>>n;
    vector<int> a(n);
    REP(i,n) cin >> a[i];
    int ma=-INF;
    int mi=INF;
    int sei=0;
    int hu=0;
    int maindex;
    int miindex;
    rep(i,n){
        if(chmax(ma,a[i])) maindex=i;
        if(chmin(mi,a[i])) miindex=i;
        if(a[i]>0) sei+=a[i];
        if(a[i]<0) hu-=a[i];
    }
    mi*=-1;
    int cnt=0;
    vec c=a;
    if(hu<=0||sei<=0){
        cout<<n-1<<endl;
    }
    else{
        if(sei/mi<hu/ma){ // 負に沈める
            rep(i,n){
                    while(a[i]>0){
                        a[i]-=mi;
                        cnt++;
                        // cout<<miindex+1<<" "<<i+1<<endl;
                }
            }
            a=c;
            cout<<cnt+n-1<<endl;
            rep(i,n){
                    while(a[i]>0){
                        a[i]-=mi;
                        cout<<miindex+1<<" "<<i+1<<endl;
                }
            }
            sei=0;
            hu=1;
        }
        else{
            rep(i,n){
                    while(a[i]<0){
                        a[i]+=ma;
                        cnt++;
                        // cout<<maindex+1<<" "<<i+1<<endl;
                    }
            }
            a=c;
            cout<<cnt+n-1<<endl;
            rep(i,n){
                    while(a[i]<0){
                        a[i]+=ma;
                        cout<<maindex+1<<" "<<i+1<<endl;
                    }
            }
            sei=1;
            hu=0;
        }
    }
    if(sei>0){
        rep(i,n-1){
            cout<<i+1<<" "<<i+2<<endl;
        }
        // debug(8);
    }
    else{
        for(int i=n;i>1;i--){
            cout<<i<<" "<<i-1<<endl;
        }
    }
    
}

Measured memory_bytes: 256