#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n), b(n);
	rep(i, n)cin >> a[i];
	rep(i, n)cin >> b[i];
	int mx = -1;
	int pos = -1;
	rep(i, n)if (chmax(mx, a[i]))pos = i;
	rep(i, n)if (chmax(mx, b[i]))pos = i + n;
	vector<pair<int, P>>ans;
	if (pos >= n) {
		ans.push_back({ 0, {0,pos - n} });
		a[0] = a[0] ^ b[pos - n];
		ans.push_back({ 1, {0,pos - n} });
		b[pos - n] = a[0] ^ b[pos - n];
		ans.push_back({ 0, {0,pos - n} });
		a[0] = a[0] ^ b[pos - n];
		pos = 0;
	}
	int x = 1;
	while (x * 2 <= a[pos]) {
		x *= 2;
	}
	rep(i, n) {
		if (x <= b[i])continue;
		ans.push_back({ 1, {pos,i} });
		b[i] = a[pos] ^ b[i];
	}
	rep(i, n) {
		if (x > a[i])continue;
		ans.push_back({ 0, {i,0} });
		a[i] = a[i] ^ b[0];
	}
	cout << ans.size() << endl;
	rep(i, ans.size()) {
		int x = ans[i].first;
		int y = ans[i].second.first;
		int z = ans[i].second.second;
		cout << x + 1 << " " << y + 1 << " " << z + 1 << endl;
	}
	/*rep(i, n) cout << a[i] << " ";
	cout << endl;
	rep(i, n) cout << b[i] << " ";
	cout << endl;*/
	return 0;
}