/*
灏忓簾鐗╋紝杩欓兘涓嶄細 /cf
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define inf (ll)1e9
#define pii pair <ll, ll>
#define fr first
#define se second
const ll mod = 1e9 + 7;
char buf[1 << 21], *p1 = buf, *p2 = buf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 18, stdin), p1 == p2) ? EOF : *p1++)
inline ll read() {
	ll x = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9') f = ((ch == '-') ? -1 : f), ch = getchar();
	while(ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
	return x * f;
}
inline void write(ll x) {
	if(x < 0) x = -x, putchar('-');
	if(x >= 10) write(x / 10);
	putchar(x % 10 + '0');
}
ll n;
ll f[1005], g[1005];
struct UnionSet {
	ll fa[1005];
	inline void makeSet(ll x) {
		for(ll i = 1; i <= x; i++) fa[i] = i;
	}
	inline ll findSet(ll x) {
		if(x == fa[x]) return x;
		return fa[x] = findSet(fa[x]);
	}
	inline ll FindSet(ll x) {
		while(x != fa[x]) x = fa[x];
		return x;
	}
	inline void unionSet(ll x, ll y) {
		x = findSet(x), y = findSet(y);
		if(x == y) return ;
		fa[x] = y;
	}
}F, G, U;
inline bool baschk() {
	for(ll i = 1; i <= n; i++) if(g[i] < 1 || g[i] > n) return 0;
	for(ll i = 1; i <= n; i++) if(g[i] == i && G.findSet(i) != i) return 0;
	for(ll i = 1; i <= n; i++) if(g[i] != i && G.findSet(i) == i) return 0;
	for(ll i = 1; i <= n; i++) for(ll j = 1; j <= n; j++) if(F.findSet(i) == F.findSet(j) && G.findSet(i) != G.findSet(j)) return 0;
	return 1;
}
vector <pii> Ans;
inline void print() {
	for(ll i = 1; i <= n; i++) U.fa[i] = f[i];
	for(auto i : Ans) {
		if(i.se) U.unionSet(i.fr, i.se);
		else U.findSet(i.fr);
	}
	for(ll i = 1; i <= n; i++) {
		if(U.fa[i] != g[i]) {
//			assert(0);
//			printf("%lld %lld %lld %lld %lld\n", f[1], f[2], f[3], f[4], f[5]);
//			printf("%lld %lld %lld %lld %lld\n", g[1], g[2], g[3], g[4], g[5]);
//			exit(0);
			puts("NO");
			return ;
		}
	}
	puts("YES");
	write((ll)Ans.size()), putchar('\n');
	for(auto i : Ans) {
		if(i.se) printf("2 "), write(i.fr), putchar(' '), write(i.se), putchar('\n');
		else printf("1 "), write(i.fr), putchar('\n');
	}
}
namespace Sol {
	ll du[1005], whi[1005];
	ll seq[1005], tot;
	vector <ll> Gr[1005], V[1005];
	inline void solve() {
		for(ll i = 1; i <= n; i++) whi[i] = du[i] = 0, Gr[i].clear(), V[i].clear(), U.fa[i] = f[i];
		
		for(ll i = 1; i <= n; i++) {
			if(i != g[i]) Gr[i].push_back(g[i]), du[g[i]]++;
			if(i != f[i]) Gr[i].push_back(f[i]), du[f[i]]++;
			
			ll x = F.findSet(i), y = F.findSet(g[i]);
			if(x != y) Gr[x].push_back(y), V[y].push_back(x), du[y]++;
		}
		
		queue <ll> Q;
		for(ll i = 1; i <= n; i++) if(!du[i]) Q.push(i);
		tot = 0;
		while(!Q.empty()) {
			ll x = Q.front();
			Q.pop();
			seq[++tot] = x;
			for(auto y : Gr[x]) {
				du[y]--;
				if(!du[y]) Q.push(y); 
			}
		}
		
		for(ll i = 1; i <= n; i++) {
			if(du[i]) {
				puts("NO");
				return ;
			}
		}
		
		for(ll i = 1; i <= tot; i++) {
			ll x = seq[i];
			if(f[x] != x) continue;
//			printf("%lld\n", x);
			
			if(whi[G.findSet(x)]) U.unionSet(whi[G.findSet(x)], x), Ans.push_back(mp(whi[G.findSet(x)], x));
			whi[G.findSet(x)] = x;	
			
			ll tag = 1;
			while(tag) {
				tag = 0;
				for(ll j = 1; j <= n; j++) if(j != x && U.fa[U.fa[j]] == x && U.fa[j] != g[j] && U.fa[U.fa[j]] != U.fa[j] && U.fa[j] != j) U.findSet(j), Ans.push_back(mp(j, 0)), tag = 1;//, printf("?? %lld\n", j);
//				exit(0);
			}
			
			
//			for(ll j = 1; j <= n; j++) printf("%lld ", U.fa[j]);
//			printf("\n----------\n");
		}
		
		print();
	}
};
int main() {
	ll T = read();
	while(T--) {
		Ans.clear();
		n = read();
		for(ll i = 1; i <= n; i++) f[i] = read();
		for(ll i = 1; i <= n; i++) g[i] = read();
		F.makeSet(n), G.makeSet(n);
		for(ll i = 1; i <= n; i++) {
			F.unionSet(i, f[i]);
			G.unionSet(i, g[i]);
		}
		if(!baschk()) {
			puts("NO");
			continue;
		}
		Sol :: solve();
	}
	return 0;
}
/*
1
5
1 2 4 5 2
1 1 1 1 1
*/