// #pragma GCC optimize("no-stack-protector")
// #pragma GCC diagnostic ignored "-W"

#include<cassert>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<sstream>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<vector>
#include<utility>

// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>

using namespace std;
// using namespace __gnu_pbds;

#define ll long long
#define ld long double
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vint vector<int>
#define SS stringstream
#define PQ priority_queue
#define MS(x,v) memset((x),(v),sizeof(x))
#define RZUNI(x) sort(x.begin(),x.end()), x.resize(unique(x.begin(),x.end())-x.begin())
#define FLH fflush(stdout)
#define CPPinput ios_base::sync_with_stdio(0); cin.tie(0)
#define FIN(fname) freopen(fname,"r",stdin)
#define FOUT(fname) freopen(fname,"w",stdout)

#define tm Ovuvuevuevue
#define y1 Enyetuenwuevue
#define left Ugbemugbem
#define ws Osas
#define dec tetteterette
#define exp expexpexpexp
#define expl explexplexpl

#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl

#ifdef WEAK
#include"/home/edison/Coding/cpp/template/debug.cpp"
#define DEB(...) printf(__VA_ARGS__),fflush(stdout)
#define WHR() printf("%s: Line %d",__PRETTY_FUNCTION__,__LINE__),fflush(stdout)
#define LOG(...) printf("%s: Line %d ",__PRETTY_FUNCTION__,__LINE__),printf(__VA_ARGS__),fflush(stdout)
#define DEBUG 1
#define exit(x) cout<<"exit code "<<x<<endl, exit(0)
#else
#define PDE(...) ;
#define DEB(...) ;
#define WHR() ;
#define LOG(...) ;
#define DEBUG 0
#endif

#define lowbit(x) ((x)&(-(x)))

#if __cplusplus >= 201103L
#include<unordered_map>
#include<unordered_set>
#include<tuple>
#endif

void JIZZ(string output=""){cout<<output; exit(0);}

const ld PI=3.14159265358979323846264338327950288;
const ld eps=1e-13;
const ll mod=1e9+7;

ll a[55];
vector<pair<int,int>> ans;

int main(){
    CPPinput;
    int n,ex; cin>>n;
    for(int i=1;i<=n;++i)cin>>a[i];
    auto pos=[&](){
        for(int i=1;i<=n;++i){
            int mx=*max_element(a+1,a+1+n);
            for(int j=1;j<=n;++j){
                if(a[j]==mx){
                    a[i]+=a[j];
                    ans.emplace_back(j,i);
                    break;
                }
            }
        }
    };
    auto neg=[&](){
        for(int i=n;i>=1;--i){
            int mn=*min_element(a+1,a+1+n);
            for(int j=1;j<=n;++j){
                if(a[j]==mn){
                    a[i]+=a[j];
                    ans.emplace_back(j,i);
                    break;
                }
            }
        }
    };
    if([&](){for(int i=1;i<=n;++i)if(a[i]<0)return 0;return 1;}())pos();
    else if([&](){for(int i=1;i<=n;++i)if(a[i]>0)return 0;return 1;}())neg();
    else if((ex=[&](){ll pos=0,neg=0;for(int i=1;i<=n;++i)pos=max(pos,a[i]),neg=min(neg,a[i]);return pos>=-neg?pos:neg;}())>=0){
        int x=0;
        for(int i=1;i<=n;++i)if(a[i]==ex){x=i;break;}
        for(int i=1;i<=n;++i)if(a[i]<0)ans.emplace_back(x,i),a[i]+=ex;
        pos();
    }
    else{
        int x=0;
        for(int i=1;i<=n;++i)if(a[i]==ex){x=i;break;}
        for(int i=1;i<=n;++i)if(a[i]>0)ans.emplace_back(x,i),a[i]+=ex;
        neg();
    }
    cout<<ans.size()<<endl;
    for(auto p:ans)cout<<p.first<<" "<<p.second<<endl;
}


Measured memory_bytes: 256