#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;

#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep_rev(i, n) for (int i = n-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()

#define pb push_back
#define eb emplace_back
#define Size(c) (int)(c).size()

#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))

template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;

template <class T, class S> inline bool chmax(T &a, S b) {
    if(a < b) {a = b;return 1;} return 0;
}
template <class T, class S> inline bool chmin(T &a, S b) {
    if(a > b) {a = b;return 1;} return 0;
}
template <class T>
void line(vector<T> &x){for (auto&& xi : x) cin >> xi;}

inline void IN(void){ return;}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){ cin >> first; IN(rest...); return;}

#define INT(...) int __VA_ARGS__; IN (__VA_ARGS__)
#define LINT(...) lint __VA_ARGS__; IN (__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)

template <class T> void UNIQUE(vector<T> &x) {
    sort(all(x)); x.erase(unique(all(x)), x.end());
}
template <class T> void print_vec(T first, T end){
    for (auto i = first; i < end - 1; i++) cout << *i << " ";
    cout << *(end-1) << endl;
}

template<class... T>
void debug_print(T... args){
    vector<lint> tmp = initializer_list<lint>{args...};
    print_vec(all(tmp));
}
template<class T>
void print(T a){ cout << a << endl;}

vector<string> Yes = {"No", "Yes"};
vector<string> YES = {"NO", "YES"};

int ord(char x){ return (int)(x - 'a');}
char chr(lint x){ return (char)(x + (lint)('a'));}
lint mod = 1e9+7;
// lint mod = 

lint sum(vlint a){lint ret = 0; for(auto&& v:a) ret += v; return ret;}
lint min_vec(vlint a, lint &index){
    lint ret = LLONG_MAX;
    rep(i, Size(a)){
        if (chmin(ret, a[i])) index = i;
    }
    return ret;
}
lint max_vec(vlint a, lint &index){
    lint ret = -LLONG_MAX;
    rep(i, Size(a)){
        if (chmax(ret, a[i])) index = i;
    };
    return ret;
}


int main(){
    INT(n); lint max_i, min_i;
    vector<vlint> ans;
    vlint a(n); line(a);
    lint max_a = max_vec(a, max_i);
    lint min_a = min_vec(a, min_i);
    lint tmp;
    if (min_a >= 0){
        rep(i, n-1){
            if (a[i] > a[i+1]){
                tmp = max_a;
                max_a = a[i+1] + tmp;
                ans.pb({max_i, i+1});
                max_i = i+1;
                a[i+1] += tmp;
            }
        }
    }
    else if (max_a <= 0){
        for (int i = n-1; i > 0; --i){
            if (a[i-1] > a[i]){
                tmp = min_a;
                min_a = a[i-1] + tmp;
                ans.pb({min_i, i-1});
                min_i = i-1;
                a[i-1] += tmp;
            }
        }
    }
    else if (abs(min_a) > max_a){
        rep(i, n){
            if (min_i == i) continue;
            ans.pb({min_i, i});
            a[i] += min_a;
        }
        min_a = min_vec(a, min_i);
        for (int i = n-1; i > 0; --i){
            if (a[i-1] > a[i]){
                tmp = min_a;
                min_a = a[i-1] + tmp;
                ans.pb({min_i, i-1});
                min_i = i-1;
                a[i-1] += tmp;
            }
        }
    }
    else{
        rep(i, n){
            if (max_i == i) continue;
            ans.pb({max_i, i});
            a[i] += max_a;
        }
        max_a = max_vec(a, max_i);
        rep(i, n-1){
            if (a[i] > a[i+1]){
                tmp = max_a;
                max_a = a[i+1] + tmp;
                ans.pb({max_i, i+1});
                max_i = i+1;
                a[i+1] += tmp;
            }
        }
    }
    print(Size(ans));
    for (auto&& v : ans){
        cout << v[0] + 1 << " " << v[1] + 1 << endl;
    }
    
    
}


Measured memory_bytes: 3616