#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigMod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T modInverse(T a, T M) {
  return bigMod(a, M - 2, M);
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T>
inline string int2String(T a) {
  ostringstream str;
  str << a;
  return str.str();
}
const int dr[] = {0, 1, 0, -1, -1, 1, 1, -1, -2, -2, 2, 2, -1, -1, 1, 1};
const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1, -1, 1, -1, 1, -2, 2, -2, 2};
int x, y;
bool b[1009][1009];
std::vector<pair<int, pair<int, int> > > res;
void Solve(int n) {
  if (n == 1) return;
  bool tmp;
  int row = 0, col = 0, empty;
  for (int j = int(1); j < int(n + 1); j++) {
    empty = 1;
    for (int i = int(1); i < int(n + 1); i++)
      if (b[i][j]) {
        empty = 0;
        break;
      }
    if (empty) {
      col = j;
      break;
    }
  }
  if (col && col != n) {
    for (int i = int(1); i < int(n + 1); i++)
      tmp = b[i][col], b[i][col] = b[i][n], b[i][n] = tmp;
    res.push_back(make_pair(2, make_pair(col, n)));
  }
  for (int i = int(1); i < int(n + 1); i++) {
    empty = 1;
    for (int j = int(1); j < int(n); j++)
      if (b[i][j]) {
        empty = 0;
        break;
      }
    if (!empty) {
      row = i;
      break;
    }
  }
  if (row && row != n) {
    for (int j = int(1); j < int(n); j++)
      tmp = b[row][j], b[row][j] = b[n][j], b[n][j] = tmp;
    res.push_back(make_pair(1, make_pair(row, n)));
  }
  Solve(n - 1);
}
int main() {
  int n;
  cin >> n;
  for (int i = int(1); i < int(n); i++) cin >> x >> y, b[x][y] = 1;
  Solve(n);
  cout << res.size() << endl;
  for (auto ans : res)
    cout << ans.first << " " << ans.second.first << " " << ans.second.second
         << endl;
  return 0;
}
