import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto A = new int[N]; foreach (i; 0 .. N) A[i] = readInt;
      auto B = new int[N]; foreach (i; 0 .. N) B[i] = readInt;
      
      int all;
      foreach (i; 0 .. N) all |= A[i];
      foreach (i; 0 .. N) all |= B[i];
      const e = bsr(all);
      
      auto as = A.dup;
      auto bs = B.dup;
      int[][] ans;
      void oper(int t, int p, int q) {
        ans ~= [t, p, q];
        final switch (t) {
          case 1: as[p] = as[p] ^ bs[q]; break;
          case 2: bs[q] = as[p] ^ bs[q]; break;
        }
      }
      
      foreach (j; 0 .. N) if (bs[j] >> e & 1) {
        foreach (i; 0 .. N) if (!(as[i] >> e & 1)) {
          oper(1, i, j);
        }
        break;
      }
      foreach (i; 0 .. N) if (as[i] >> e & 1) {
        foreach (j; 0 .. N) if (!(bs[j] >> e & 1)) {
          oper(2, i, j);
        }
        break;
      }
      foreach (j; 0 .. N) if (bs[j] >> e & 1) {
        foreach (i; 0 .. N) if (as[i] >> e & 1) {
          oper(1, i, j);
        }
        break;
      }
      
      writeln(ans.length);
      foreach (op; ans) {
        writeln(op[0], " ", op[1] + 1, " ", op[2] + 1);
      }
      
      assert(as.maxElement < bs.minElement);
    }
  } catch (EOFException e) {
  }
}