#include <cstdio>
#include <algorithm>
using namespace std;
const int N=1e3+5;
const int M=2e4+5;
struct node{
	int b,opos;
	bool operator <(const node &other)const{
		if(b!=other.b)return b<other.b;
		return opos<other.opos; 
	}
}a[N];
int n,tot,cnt,nowcnt,x[N],pos[N],ans1[M],ans2[M];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i].b);
		a[i].opos=i;
	}
	sort(a+1,a+n+1);
	a[0].b=-1;
	for(int i=1;i<=n;i++){
		if(a[i].b!=a[i-1].b){
			x[++tot]=a[i].b;
			pos[tot]=i;
		}
	}
	pos[tot+1]=n+1;
	if(tot==1){
		cnt=x[1];
		printf("%d\n",cnt);
		for(int i=0;i<x[1];i++){
			printf("%d %d\n",1,i);
		}
		return 0;
	}
	nowcnt=0;
	for(int i=0;i<x[1];i++){
		ans1[++nowcnt]=1,ans2[nowcnt]=i;
	}
	for(int i=2;i<=tot;i++){
		int dc1=n-pos[i];
		for(int j=pos[i];j<=n;j++){
			ans1[++nowcnt]=2,ans2[nowcnt]=a[j].opos;
		}
		int dc2=x[i]-x[i-1]-1;
		for(int j=x[i-1]+1;j<x[i];j++){
			ans1[++nowcnt]=1,ans2[nowcnt]=j;
		}
	}
	printf("%d\n",nowcnt);
	for(int i=1;i<=nowcnt;i++){
		printf("%d %d\n",ans1[i],ans2[i]);
	}
	return 0;
}