//Rahman ve Rahim olan Allah'ın adıyla
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define fi first
#define se second
#define mid (st+end)/2
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int n;cin>>n;vector<array<int,2>>arr(n);vector<int>res(n*2,0);vector<array<int,2>>ans;vector<bool>vis(2*n,false);
for(int i=0;i<n;i++){
cin>>arr[i][0]>>arr[i][1];res[(arr[i][0]+arr[i][1])%(2*n)]++;
}int mx=0,mxi=0;for(int i=1;i<n*2;i+=2){
if(res[i]>mx){mx=res[i];mxi=i;}
}cout<<n-mx<<"\n";
for(int i=0;i<n;i++){
if((arr[i][0]+arr[i][1])%(n*2)==mxi){vis[arr[i][0]]=true;vis[arr[i][1]]=true;continue;}
if(vis[(mxi-arr[i][0]+(n*2))%(n*2)]){swap(arr[i][0],arr[i][1]);}
if(vis[(mxi-arr[i][0]+(n*2))%(n*2)]){continue;}
cout<<i<<" "<<arr[i][1]<<" "<<(mxi-arr[i][0]+(n*2))%(n*2)<<"\n";
vis[arr[i][0]]=true;vis[(mxi-arr[i][0]+(n*2))%(n*2)]=true;
}
}
