import java.util.ArrayList;
import java.util.List;

public class Main {
  private static void solve() {
    int n = ni();
    int[] a = na(n);
    
    int amax = -1;
    int maxPtr = 0;
    for (int i = 0; i < n; i ++) {
      if (Math.abs(a[i]) > amax) {
        amax = Math.abs(a[i]);
        maxPtr = i;
      }
    }
    
    if (a[maxPtr] == 0) {
      System.out.println(0);
      return;
    }

    List<int[]> ret = new ArrayList<>();
    if (a[maxPtr] > 0) {
      if (maxPtr < n - 1) {
        ret.add(new int[] {maxPtr, n - 1});
        ret.add(new int[] {maxPtr, n - 1});
        a[n - 1] += a[maxPtr] * 2;
      } else {
        ret.add(new int[] {maxPtr, n - 1});
        a[n - 1] *= 2;
      }
      
      for (int i = 1; i < n; i ++) {
        ret.add(new int[] {n - 1, i});
        ret.add(new int[] {n - 1, n - 1});
        a[i] += a[n - 1];
        a[n - 1] += a[n - 1];
      }
      
    } else {
      if (maxPtr > 0) {
        ret.add(new int[] {maxPtr, 0});
        ret.add(new int[] {maxPtr, 0});
        a[0] += a[maxPtr] * 2;
      } else {
        ret.add(new int[] {maxPtr, 0});
        a[0] *= 2;
      }
      
      for (int i = n - 1; i > 0; i --) {
        ret.add(new int[] {0, i});
        ret.add(new int[] {0, 0});
        a[i] += a[0];
        a[0] += a[0];
      }
    }
    
    System.out.println(ret.size());
    for (int[] v : ret) {
      
      System.out.println((v[0] + 1) + " " + (v[1] + 1));
    }
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}




Measured memory_bytes: 22996