#include <bits/stdc++.h>
using namespace std;
const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};
const double EPS = 1e-8;
const double PI = acos(-1.0);
int popcount(int n) { return __builtin_popcount(n); }
int popcount(long long n) { return __builtin_popcountll(n); }
template <class T>
int SIZE(T a) {
  return a.size();
}
template <class T>
string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T>
T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++) res = (res * 10 + str[i] - '0');
  return res;
}
template <class T>
T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
void PrintSeq(T &a, int sz) {
  for (int i = 0; i < sz; i++) {
    cout << a[i];
    if (sz == i + 1)
      cout << endl;
    else
      cout << ' ';
  }
}
bool EQ(double a, double b) { return abs(a - b) < EPS; }
bool EQV(complex<double> a, complex<double> b) {
  return EQ(a.real(), b.real()) & EQ(a.imag(), b.imag());
}
void fastStream() {
  cin.tie(0);
  std::ios_base::sync_with_stdio(0);
}
vector<string> split(string str, char del) {
  vector<string> res;
  for (int i = 0, s = 0; i < SIZE(str); i++) {
    if (str[i] == del) {
      if (i - s != 0) res.push_back(str.substr(s, i - s));
      s = i + 1;
    } else if (i == SIZE(str) - 1) {
      res.push_back(str.substr(s));
    }
  }
  return res;
}
int xs[1010], ys[1010];
bool field[1010][1010];
bool tmp[1010][1010];
int heights[1010];
int idxToPos[1010];
int posToIdx[1010];
int goal[1010];
int main() {
  vector<pair<pair<int, int>, int> > anss;
  int N;
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> ys[i] >> xs[i];
    field[ys[i] - 1][xs[i] - 1] = true;
  }
  for (int k = 0; k < 2; k++) {
    if (k == 1)
      for (int i = 0; i < N; i++) heights[i] = 1 << 30;
    else
      for (int i = 0; i < N; i++) heights[i] = 0;
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        if (field[i][j]) {
          heights[i] = j + 1;
          if (k == 1) break;
        }
      }
    }
    vector<pair<int, int> > v;
    for (int i = 0; i < N; i++) v.push_back(pair<int, int>(heights[i], i));
    sort(v.begin(), v.end());
    for (int i = 0; i < N; i++) idxToPos[i] = posToIdx[i] = i;
    for (int i = 0; i < N; i++) {
      int nowPos = i;
      int nowPosId = posToIdx[nowPos];
      int toPosId = v[i].second;
      int toPos = idxToPos[toPosId];
      if (nowPos != toPos) {
        anss.push_back(make_pair(pair<int, int>(nowPos + 1, toPos + 1), k + 1));
        swap(idxToPos[nowPosId], idxToPos[toPosId]);
        swap(posToIdx[nowPos], posToIdx[toPos]);
        swap(field[nowPos], field[toPos]);
      }
    }
    for (int i = 0; i < N; i++)
      for (int j = 0; j < N; j++) tmp[j][i] = field[i][j];
    for (int i = 0; i < N; i++)
      for (int j = 0; j < N; j++) field[i][j] = tmp[i][j];
  }
  cout << (int)anss.size() << endl;
  for (int i = 0; i < (int)anss.size(); i++) {
    cout << anss[i].second << " ";
    cout << anss[i].first.first << " ";
    cout << anss[i].first.second << endl;
  }
  return 0;
}
