#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define drep(i,a,b) for (int i = (a); i >= (b); i--)
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(v) ((int)v.size())
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define umap unordered_map
using namespace std;
namespace qiqi {
	struct DSU {
		vi fa;
		DSU(vi &vec) {fa = vec;}
		bool isroot(int x) {return x == fa[x];}
		int find(int x) {return x == fa[x] ? x : fa[x] = find(fa[x]);}
		void merge(int x,int y) {
			x = find(x); y = find(y);
			if (x == y) return;
			fa[y] = x;
		}
	};
	void main() {
		int n; cin >> n;
		vi vec(n);
		rep(i,0,n) {
			cin >> vec[i]; --vec[i];
		}
		DSU cur(vec),dsu(vec);
		rep(i,0,n) {
			cin >> vec[i]; --vec[i];
		}
		DSU ed(vec);
		vector<vi> e(n),g(n); vi d(n);
		vector<pii> ans;
		rep(i,0,n) {
			int x = ed.fa[i];
			if (x != cur.fa[i]) {
				cur.find(i); ans.eb(i,-1);
				if (x != cur.fa[i]) {
					if (!cur.isroot(x)) {
						cout << "NO\n";
						return;
					}
					++d[x];
					e[cur.find(i)].eb(x);
					g[x].eb(cur.find(i));
				}
			}
		}
		queue<int> q;
		rep(i,0,n) {
			if (!d[i]) q.emplace(i);
		}
		vi p;
		while (sz(q)) {
			int u = q.front(); q.pop(); p.eb(u);
			for (auto v:e[u]) {
				if (!(--d[v])) q.push(v);
			}
		}
		for (auto v:p) {
			for (auto u:g[v]) {
				int x = dsu.find(u);
				cur.merge(v,x); ans.eb(x,v);
				dsu.merge(v,x);
				rep(i,0,n) {
					if (cur.fa[i] != ed.fa[i]) {
						cur.find(i); ans.eb(i,-1);
					}
				}
			}
		}
		rep(i,0,n) {
			if (cur.fa[i] != ed.fa[i]) {
				cout << "NO\n";
				return;
			}
		}
		cout << "YES\n" << sz(ans) << '\n';
		for (auto [x,y]:ans) {
			if (y == -1) cout << 1 << ' ' << x+1 << '\n';
			else cout << 2 << ' ' << x+1 << ' ' << y+1 << '\n';
		}
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int T; cin >> T;
	while (T--) qiqi::main();
	return 0;
}