ll c[6000],n;

VI res;
void ent(ll p,ll q){
	res.push_back(p+1);
	res.push_back(q+1);
	swap(c[p],c[q+n]);
}

{
	rd(n);
	ll@d[2n];
	c[0..2n-1]=d[0..];
	sortF(2n,d);
	ll i=0,j=0;
	while(i<n&&j<n){
		while(i<n&&c[i]<=d[n-1])++i;
		while(j<n&&c[j+n]>=d[n])++j;
		if(i<n&&j<n){
			ent(i,j);
		}
	}
	if(i<n){
		j=0;
		while(i<n){
			while(i<n&&c[i]<=d[n-1])++i;
			while(j<n&&c[j+n]>d[n-1])++j;
			if(i<n){
				ent(i,j);
			}
		}
	}
	if(j<n){
		i=0;
		while(j<n){
			while(i<n&&c[i]<d[n])++i;
			while(j<n&&c[j+n]>=d[n])++j;
			if(j<n){
				ent(i,j);
			}
		}
	}
	wt((ll)(res.size()/2*3));
	rep(i,0,res.size(),2){
		wt(1,res[i],res[i+1]);
		wt(2,res[i],res[i+1]);
		wt(1,res[i],res[i+1]);
	}
}