#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 vis[N], d[N], dep[N], id[N]; vector<int> edge[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;
}
void build() {
	for(int i = 1; i <= n; i++) vis[i] = d[i] = 0, id[i] = i;
	sort(id + 1, id + n + 1, [&](int x, int y) {return dep[x] > dep[y];});
	for(int i = 1; i <= n; i++) {
		int x = id[i];
		if(g[x] == x) continue;
		if(flag[x] && g[x] != f[x] && !vis[f[x]]) vis[f[x]] = g[x], d[g[x]]++;//, cerr << x << ' ' << f[x] << ' ' << vis[f[x]] << endl;
		if(f[x] == x && !vis[x]) vis[x] = g[x], d[g[x]]++;//, cerr << "??" << x << ' ' << vis[x] << endl;
	}
	queue<int> q;
	for(int i = 1; i <= n; i++)
		if(d[i] == 0) q.push(i);
	while(!q.empty()) {
		int x = q.front(); q.pop();
		if(!vis[x]) continue; assert(!flag[x] && !flag[g[x]]);
		unite(x, vis[x]);
		for(int i = 1; i <= n; i++)
			if(f[i] == x && g[i] != x) find(i);
		d[vis[x]]--;
		if(!d[vis[x]]) q.push(vis[x]);
	}
}
void dfs(int x) {
	for(int i : edge[x])
		dep[i] = dep[x] + 1, dfs(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++) edge[i].clear();
		for(int i = 1; i <= n; i++) if(g[i] != i) edge[g[i]].emplace_back(i);
		for(int i = 1; i <= n; i++)
			if(g[i] == i) {
				dep[i] = 0, dfs(i);
			}
		build();
		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;
}