#include "bits/stdc++.h"
#include <sys/timeb.h>
#include <fstream>
#include <random>

using namespace std;

#define repr(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repr(i,0,n)
#define reprrev(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define reprev(i,n) reprrev(i,0,n)
#define repi(itr,ds) for(auto itr=ds.begin();itr!=ds.end();itr++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFR INT_MAX
#define INFL (long long)(4e18)
#define INFLR LLONG_MAX
#define EPS (1e-10)
#define MOD 1000000007
#define PI 3.1415926536
#define RMAX 4294967295

typedef long long ll;
typedef pair<int, int> Pi;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<Pi> vPi;
typedef vector<vector<int> > vvi;
typedef vector<vector<bool> > vvb;
typedef vector<vector<ll> > vvll;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<double> > vvd;
typedef vector<vector<Pi> > vvPi;
typedef priority_queue<int, vector<int>, greater<int> > pqli;
typedef priority_queue<ll, vector<ll>, greater<ll> > pqlll;
typedef priority_queue<Pi, vector<Pi>, greater<Pi> > pqlP;
template <class T>
using vec = vector<T>;
template<class T>
using pql = priority_queue<T, vector<T>, greater<T>>;
string debug_show(Pi a) {
	return "(" + to_string(a.first) + "," + to_string(a.second) + ")";
}
string YN(bool y) { return (y ? "YES" : "NO"); }
string yn(bool y) { return (y ? "Yes" : "No"); }
string ON(bool y) { return (y ? "OK" : "NG"); }

int dir4[4][2] = { { 0,-1 },{ -1,0 },{ 1,0 },{ 0,1 } };
int dir8[8][2] = { { -1,-1 },{ 0,-1 },{ 1,-1 },{ -1,0 },{ 1,0 },{ -1,1 },{ 0,1 },{ 1,1 } };

// [a,b]の乱数
int irand(int a, int b) {
	static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
	uniform_int_distribution<int> dist(a, b);
	return dist(Rand);
}

// [a,b)の乱数
double drand(int a, int b) {
	static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
	uniform_real_distribution<double> dist(a, b);
	return dist(Rand);
}

template<typename T>
istream& operator >> (istream& is, vector<T>& vec) {
	for (T& x : vec) is >> x;
	return is;
}
//=======ここまでテンプレート===============================================



int main(void) {
	int N;
	cin >> N;
	vi a(N);
	int pmax = -1, mmax = 1;
	int pi = 0, mi = 0;
	rep(i, N) {
		cin >> a[i];
		if (a[i] >= 0) {
			if (a[i] > pmax) {
				pmax = a[i];
				pi = i;
			}
		}
		else {
			if (a[i] < mmax) {
				mmax = a[i];
				mi = i;
			}
		}
	}
	vPi move;

	if (mmax == 1) {
		rep(i, N - 1) {
			move.push_back(mp(i + 1, i + 2));
		}
	}
	else if (pmax == -1) {
		reprev(i, N - 1) {
			move.push_back(mp(i + 2, i + 1));
		}
	}
	else if (pmax >= -mmax) {
		rep(i, N) {
			if (a[i] < 0) {
				move.push_back(mp(pi + 1, i + 1));
			}
		}
		rep(i, N - 1) {
			move.push_back(mp(i + 1, i + 2));
		}
	}
	else {
		rep(i, N) {
			if (a[i] > 0) {
				move.push_back(mp(mi + 1, i + 1));
			}
		}
		reprev(i, N - 1) {
			move.push_back(mp(i + 2, i + 1));
		}
	}

	cout << move.size() << endl;
	for (auto p : move) {
		cout << p.first << " " << p.second << endl;
	}

	return 0;
}

Measured memory_bytes: 256