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

#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

const int32_t inf = 1001001001;
const int64_t infll = 1001001001001001001ll;
const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}, dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

template <typename T> using vector2d = vector<vector<T>>;
// clang-format off
template <typename T> void sort(vector<T> &v) { sort(all(v)); }
ostream &operator<<(ostream &os, __int128_t value) { if (ostream::sentry(os)) { __uint128_t tmp = value < 0 ? -value : value; char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; }
istream &operator>>(istream &is, __int128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } if (in[0] == '-') value *= -1; return is; }
ostream &operator<<(ostream &os, __uint128_t value) { if (ostream::sentry(os)) { char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[value % 10]; value /= 10; } while (value != 0); int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; }
istream &operator>>(istream &is, __uint128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } return is; }
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { os << v[0]; for (int i = 1; i < v.size(); ++i) os << " " << v[i]; return os; }
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << p.fs << " " << p.sc; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.fs >> p.sc; return is; }

inline int64_t in(){int64_t x=0,m=0,k;for(;;){k=getchar_unlocked();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k=getchar_unlocked();if(k<'0'||'9'<k)break;x=x*10+k-'0';}if(m)x=-x;return x;}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// clang-format on

vector<pair<int, int>> ans;
void put_ans(int x, int y) {
  ans.pb(x + 1, y + 1);
  // printf("%d %d", x + 1, y + 1);
}

signed main(int argc, char *argv[]) {
  int n = in();
  vector<int> a(n);
  cin >> a;

  int idx = -1, abs_v = -1;
  for (int i = 0; i < n; ++i) {
    if (abs(a[i]) > abs_v) {
      idx = i;
      abs_v = abs(a[i]);
    }
  }

  if (a[idx] < 0) {
    for (int i = 0; i < n; ++i) {
      if (a[i] > 0) {
        a[i] += a[idx];
        put_ans(idx, i);
      }
    }
    for (int i = n - 2; i >= 0; --i) {
      if (a[i] < a[i + 1]) {
        put_ans(i, i);
      } else {
        put_ans(i + 1, i);
      }
      a[i] += min(a[i], a[i + 1]);
    }
  }

  else {
    for (int i = 0; i < n; ++i) {
      if (a[i] < 0) {
        a[i] += a[idx];
        put_ans(idx, i);
      }
    }
    for (int i = 1; i < n; ++i) {
      if (a[i - 1] < a[i]) {
        put_ans(i, i);
      } else {
        put_ans(i - 1, i);
      }
      a[i] += max(a[i], a[i - 1]);
    }
  }

  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); ++i) {
    cout << ans[i] << endl;
  }
}


Measured memory_bytes: 256