//#include <bits/stdc++.h>
 
#include <iostream>
#include <algorithm>
 
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>
 
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
 
 
using namespace std;
#define int long long
 
typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;
 
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
 
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const double EPS = 1e-12;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
 
#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false

int n, ps, ms, ze;
int a[55], b[55];

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n;
    int mx = -1000006;
    int mn = 1000006;
    int idxmx = -1;
    int idxmn = -1;
    rep(i, n) {
        cin >> a[i];
        b[i] = a[i];
        if (a[i] > 0) ps++;
        else if (a[i] < 0) ms++;
        else ze++;
        if (mx < a[i]) {
            mx = a[i];
            idxmx = i;
        }
        if (a[i] < mn) {
            mn = a[i];
            idxmn = i;
        }
        
    }
    if (ze == n) {
        cout << 0 << endl;
        return 0;
    }
    if (ps == 0) {
        cout << n - 1 << endl;
        rrep2(i, n, 1) cout << i << " " << i - 1 << endl;
        return 0;
    }
    if (ms == 0) {
        cout << n - 1 << endl;
        rep2(i, 1, n) cout << i << " " << i + 1 << endl;
        return 0;
    }
    int lim = 2 * n;
    while (lim > n - 1 + ms) {
        mx += mx;
        a[idxmx] += a[idxmx];
        lim--; 
    }
    bool ok = true;
    vector<int> v;
    rep(i, n) {
        if (a[i] < 0) {
            v.push_back(i);
            a[i] += mx;
            if (a[i] < 0) ok = false;
        }
    }
    if (ok) {
        cout << 2 * n << endl;
        rep(i, 2 * n - (n - 1 + ms)) cout << idxmx + 1 << " " << idxmx + 1 << endl;
        rep(i, ms) cout << idxmx + 1 << " " << v[i] + 1 << endl;
        rep(i, n - 1) cout << i + 1 << " " << i + 2 << endl;
        return 0;
    }

    lim = 2 * n;
    while (lim > n - 1 + ps) {
        mn += mn;
        b[idxmn] += b[idxmn];
        lim--;
    }
    vector<int> vv;
    rep(i, n) {
        if (b[i] > 0) {
            vv.push_back(i);
            b[i] += mn;
        }
    }
    cout << 2 * n << endl;
    rep(i, 2 * n - (n - 1 + ps)) cout << idxmn + 1 << " " << idxmn + 1 << endl;
    rep(i, ps) cout << idxmn + 1 << " " << vv[i] + 1 << endl;
    rrep2(i, n, 1) cout << i << " " << i - 1 << endl;
}


Measured memory_bytes: 256