#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <deque>
#include <map>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#define SZ(x) int(x.size())
#define FR(i,a,b) for(int i=(a);i<(b);++i)
#define FOR(i,n) FR(i,0,n)
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define A first
#define B second
#define mp(a,b) make_pair(a,b)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned __int128 U128;
typedef __int128 I128;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
using namespace std;
const LL MAXN=2e5+5;
LL p[MAXN][2], v[MAXN];
signed main(){
FAST;
LL n; cin>>n;
FOR(i,n){
LL a,b; cin>>a>>b;
p[i][0]=a;
p[i][1]=b;
v[(a+b)%(2*n)]++;
}
LL mx=0, id=0;
for (int i=1; i<2*n; i+=2){
if (v[i]>=mx){
mx=v[i];
id=i;
}
}
cout<<n-mx<<"\n";
LL off=(2*n-1-id)/2;
queue<pair<LL,PLL> > q;
FOR(i,n){
if ((p[i][0]+p[i][1])%(2*n)!=id) q.push(mp(i, mp(p[i][0], p[i][1])));
//else cout<<"good: "<<p[i][0]<<" "<<p[i][1]<<"\n";
}
while (!q.empty()){
LL i=q.front().A, a=q.front().B.A, b=q.front().B.B;
q.pop();
if ((a+off)%(2*n)>(b+off)%(2*n)) swap(a,b);
LL c=(2*n+id-a)%(2*n);
cout<<i<<" "<<b<<" "<<c<<"\n";
//cout<<"good: "<<a<<" "<<c<<"\n";
}
return 0;
}
