#include <bits/stdc++.h>
using namespace std;
long long a[1001][1001];
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long dx[] = {0, 0, 1, -1};
long long dy[] = {1, -1, 0, 0};
long long findcol(long long ans) {
  long long c = 0;
  for (long long int i = 0; i < ans + 1; i++) {
    for (long long int j = 0; j < ans + 1; j++) {
      if (a[j][i] == false) c++;
    }
    if (c == ans + 1)
      return i;
    else
      c = 0;
  }
  return ans;
}
long long findrow(long long ans) {
  for (long long int i = 0; i < ans + 1; i++) {
    for (long long int j = 0; j < ans + 1; j++) {
      if (a[i][j] == true) return i;
    }
  }
  return ans;
}
void swapco(long long g, long long b) {
  long long temp;
  for (long long int i = 0; i < b + 1; i++) {
    temp = a[i][g];
    a[i][g] = a[i][b];
    a[i][b] = temp;
  }
}
void swapro(long long g, long long b) {
  long long temp;
  for (long long int i = 0; i < b + 1; i++) {
    temp = a[g][i];
    a[g][i] = a[b][i];
    a[b][i] = temp;
  }
}
void solve() {
  long long n;
  vector<long long> v;
  cin >> n;
  long long l, r;
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < n; j++) a[i][j] = false;
  }
  for (long long int i = 0; i < n - 1; i++) {
    cin >> l >> r;
    a[l - 1][r - 1] = true;
  }
  for (long long i = n - 1; i >= 1; i--) {
    long long col = findcol(i);
    long long row = findrow(i);
    if (col != i) {
      swapco(col, i);
      v.push_back(2);
      v.push_back(col + 1);
      v.push_back(i + 1);
    }
    if (row != i) {
      swapro(row, i);
      v.push_back(1);
      v.push_back(row + 1);
      v.push_back(i + 1);
    }
  }
  cout << v.size() / 3 << "\n";
  for (long long int i = 0; i < v.size(); i++) {
    cout << v[i];
    if (i % 3 == 2)
      cout << "\n";
    else
      cout << " ";
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int test = 1;
  while (test--) solve();
  return 0;
}
