#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
template<typename T> inline void read(T &F) {
	F = 0; int R = 1; char CH = getchar();
	for(; !isdigit(CH); CH = getchar()) if(CH == '-') R = -1;
	for(; isdigit(CH); CH = getchar()) F = F * 10 + CH - 48;
	F *= R;
}
const int N = 1e3 + 10;
int f[N], g[N], n, flag[N];
vector<pair<int, pair<int, int> > > R;
int findx(int x) {
	return f[x] == x ? x : f[x] = findx(f[x]);
}
void find(int x) {
	findx(x); R.emplace_back(make_pair(1, make_pair(x, 0)));
}
void unite(int x, int y) {
	x = findx(x), y = findx(y);
	f[x] = y; R.emplace_back(make_pair(2, make_pair(x, y)));
}
int d[N], vis[N]; vector<int> edge[N], e[N];
bool check() {
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) vis[j] = 0;
		int x = i;
		while(g[x] != x) {
			if(vis[x]) return false;
			vis[x] = 1; x = g[x];
		}
	}
	return true;
}
int tp[N];
int find_tp(int x) {
	return (g[x] == x || (f[g[x]] != g[x])) ? x : find_tp(g[x]);
}
void dfs(int x, int y) {
	if(x != y && (f[x] == x || flag[x])) {
		if(flag[x] && f[x] != y) edge[f[x]].emplace_back(y), d[y]++;
		else if(f[x] == x) edge[x].emplace_back(y), d[y]++;
	}
	if(f[x] != x) return;
	for(int i : e[x]) dfs(i, y);
}

void build() {
	for(int i = 1; i <= n; i++)  d[i] = 0, edge[i].clear(), tp[i] = 0;
	for(int i = 1; i <= n; i++) if(f[i] == i) dfs(i, i);
	queue<int> q;
	for(int i = 1; i <= n; i++) if(d[i] == 0 && f[i] == i) q.push(i);
	while(!q.empty()) {
		int x = q.front(); q.pop();
		const int y = tp[find_tp(x)];
		if(y) {
			unite(y, x); 
			for(int j = 1; j <= n; j++)
				if(f[j] == y && g[j] != y) find(j);
		}
		tp[find_tp(x)] = x;
		for(int i : edge[x]) {
			d[i]--; if(!d[i]) q.push(i);
		}
	}
}
int main() {
	//freopen("path.in", "r", stdin);
	//freopen("path.out", "w", stdout);
	int T; read(T);
	while(T--) {
		read(n); R.clear();
		for(int i = 1; i <= n; i++) read(f[i]);
		for(int i = 1; i <= n; i++) read(g[i]);
		if(!check()) {
			puts("NO"); continue;
		}
		for(int i = 1; i <= n; i++) {
			flag[i] = 0;
			if(f[i] == i) continue;
			if(g[i] != f[i] || f[f[i]] == f[i]) flag[i] = 1;
		}
		int F = 1;
		for(int i = 1; i <= n && F; i++) {
			if(!flag[i]) continue;
			int x = i;
			while(f[x] != x) {
				F &= flag[x];
				x = f[x];
			}
		}
		if(!F) {
			puts("NO"); continue;
		}
		for(int i = 1; i <= n; i++) if(flag[i]) find(i);
		for(int i = 1; i <= n && F; i++)
			if(g[i] != i) {
				if(flag[i] && flag[g[i]]) F = 0;
			}
			else if(f[i] != i) F = 0;
		if(!F) {
			puts("NO"); continue;
		}
		for(int i = 1; i <= n; i++) e[i].clear();
		for(int i = 1; i <= n; i++) if(g[i] != i) e[g[i]].emplace_back(i);
		build();
		for(int i = 1; i <= n; i++) if(f[i] != g[i]) unite(i, g[i]);
		for(int i = 1; i <= n && F; i++) if(f[i] != g[i]) F = 0;
		if(!F) {
			puts("NO"); continue;
		}
		puts("YES");
		cout << R.size() << '\n';
		for(auto i : R) {
			if(i.first == 1) cout << i.first << ' ' << i.second.first << '\n';
			else cout << i.first << ' ' << i.second.first << ' ' << i.second.second << '\n';
		}
	}
	return 0;
}