#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;

/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real = xxx::number<xxx::cpp_dec_float<1024>>;
*/

#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0LL, sizeof(x))
#define mm(x) memset((x), -1LL, sizeof(x))

//container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#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 UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
  sort(ALL(c)); \
  for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))

// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;

// bit_macro
#define Bit(n) (1LL << (n))
#define Bitset(a, b) (a) |= (1LL << (b))
#define Bitunset(a, b) (a) &= ~(1LL << (b))
#define Bitcheck(a, b) ((((a) >> (b)) & 1LL) == 1LL)
#define Bitcount(a) __builtin_popcountll((a))

//typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;

//constant
constexpr int INF = (int)1e18;
constexpr int MOD = (int)1e9 + 7;
constexpr double PI = (double)acos(-1);
constexpr double EPS = (double)1e-10;
constexpr int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1};
constexpr int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1};

//
template <typename T>
void chmax(T &a, T b) { a = max(a, b); }
template <typename T>
void chmin(T &a, T b) { a = min(a, b); }
//
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();
}

//
struct Accelerate_Cin {
  Accelerate_Cin() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
  };
} Accelerate_Cin;

signed main() {
  int N;
  cin >> N;
  vector<int> a(N + 1);
  int mx = -INF, mn = INF;
  for (int i = 1; i <= N; i++) {
    cin >> a[i];
    chmax(mx, a[i]);
    chmin(mn, a[i]);
  }

  bool f;
  if (abs(mx) > abs(mn)) {
    f = true;
  } else {
    f = false;
  }

  vector<P> ans;

  if (f) {
    priority_queue<P, vector<P>> q;
    for (int i = 1; i <= N; i++) q.push(P(a[i], i));

    for (int i = 1; i + 1 <= N; i++) {
      while (a[i] > a[i + 1]) {
        P p = q.top();
        ans.push_back(P(p.second, i + 1));
        a[i + 1] += p.first;
        q.push(P(a[i + 1], i + 1));
      }
    }

  } else {
    priority_queue<P, vector<P>> q;
    for (int i = 1; i <= N; i++) a[i] *= -1;
    for (int i = 1; i <= N; i++) q.push(P(a[i], i));

    for (int i = N - 1; i >= 1; i--) {
      while (a[i + 1] > a[i]) {
        P p = q.top();
        ans.push_back(P(p.second, i));
        a[i] += p.first;
        q.push(P(a[i], i));
      }
    }
  }

  cout << ans.size() << endl;
  for (auto x : ans) cout << x.first << " " << x.second << endl;
  return 0;
}


Measured memory_bytes: 256