#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> a(n), b(n);
  REP(i, n) cin >> a[i];
  REP(i, n) cin >> b[i];
  const int max_a = max_element(ALL(a)) - a.begin();
  vector<tuple<int, int, int>> ans;
  REP(i, n) {
    if (chmax(b[i], b[i] ^ a[max_a])) ans.emplace_back(2, max_a, i);
  }
  int min_b = -1;
  REP(i, n) {
    if (__builtin_clz(b[i]) == __builtin_clz(a[max_a])) {
      min_b = i;
      break;
    }
  }
  REP(i, n) {
    if (chmin(a[i], a[i] ^ b[min_b])) ans.emplace_back(1, i, min_b);
  }
  assert(*max_element(ALL(a)) < *min_element(ALL(b)));
  cout << ans.size() << '\n';
  for (const auto [t, p, q] : ans) {
    cout << t << ' ' << p + 1 << ' ' << q + 1 << '\n';
  }
  return 0;
}