#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<int D, typename T>struct vec : public vector<vec<D - 1, T>> {template<typename... Args>vec(int n = 0, Args... args) : vector<vec<D - 1, T>>(n, vec<D - 1, T>(args...)) {}};
template<typename T>struct vec<1, T> : public vector<T> {vec(int n = 0, T val = T()) : vector<T>(n, val) {}};
template<class T1,class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const deque<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
int ri(){int x;scanf("%i",&x);return x;}
void rd(int&x){scanf("%i",&x);}
void rd(long long&x){scanf("%lld",&x);}
void rd(double&x){scanf("%lf",&x);}
void rd(long double&x){scanf("%Lf",&x);}
void rd(string&x){cin>>x;}
void rd(char*x){scanf("%s",x);}
template<typename T1,typename T2>void rd(pair<T1,T2>&x){rd(x.first);rd(x.second);}
template<typename T>void rd(vector<T>&x){for(T&p:x)rd(p);}
template<typename C,typename...T>void rd(C&a,T&...args){rd(a);rd(args...);}
//istream& operator>>(istream& is,__int128& a){string s;is>>s;a=0;int i=0;bool neg=false;if(s[0]=='-')neg=true,i++;for(;i<s.size();i++)a=a*10+s[i]-'0';if(neg)a*=-1;return is;}
//ostream& operator<<(ostream& os,__int128 a){bool neg=false;if(a<0)neg=true,a*=-1;ll high=(a/(__int128)1e18);ll low=(a-(__int128)1e18*high);string res;if(neg)res+='-';if(high>0){res+=to_string(high);string temp=to_string(low);res+=string(18-temp.size(),'0');res+=temp;}else res+=to_string(low);os<<res;return os;}

const int N=1005;
vector<set<int>> decica(N);
vector<int> par(N),trebapar(N);
vector<pair<int,int>> ops;
vector<set<int>> trd(N);
vector<int> ordering;
void dfs(int tr){
	for(auto p:decica[tr]){
		dfs(p);
	}
	ordering.pb(tr);
}
void test(int ind,int tt){
	ordering.clear();
	ops.clear();
	int n=ri();
	for(int i=0;i<n;i++){
		decica[i].clear();
		trd[i].clear();
	}
	for(int i=0;i<n;i++){
		int a=ri()-1;
		trebapar[i]=a;
		if(a!=i){
			decica[a].insert(i);
		}
	}
	for(int i=0;i<n;i++){
		if(trebapar[i]==i){
			dfs(i);
		}
	}
	vector<int> pars;
	for(int i=0;i<n;i++){
		par[i]=ri()-1;
		if(par[i]==i){
			pars.pb(i);
		}
		if(par[i]!=i)
			trd[par[i]].insert(i);
	}
	/*if(ind==5183){
		printf("%i\n",n);
		for(int i=0;i<n;i++){
			printf("%i ",trebapar[i]+1);
		}
		printf("\n");
		for(int i=0;i<n;i++){
			printf("%i ",par[i]+1);
		}
		printf("\n");
	}*/
	while(sz(pars)){
		int tr=pars.back();
		pars.pop_back();
		//printf("Procesiram %i\n",tr);
		//cout << "Pocetni " << trd[tr] << endl;
		// satisfy all child conditions with find
		if(sz(decica[tr])==0){
			reverse(all(ordering));
		}
		for(auto p:ordering){
			int a=p,b=trebapar[p];
			if(a==b)
				continue;
			bool found=0;
			int i=p;
			if(trd[tr].find(p)!=trd[tr].end()){
				while(i!=trebapar[i]){
					i=trebapar[i];
					if(trd[tr].find(i)==trd[tr].end()||i==p){
						continue;
					}
					//printf("%i %i\n",p,i);
					trd[tr].erase(p);
					par[p]=i;
					trd[i].insert(p);
					ops.pb({-1,p});
					found=1;
					break;
				}
			}
			if(found)
				continue;
			if(trd[tr].find(b)!=trd[tr].end()){
				while(a!=par[a]){
					a=par[a];
					if(trd[tr].find(a)==trd[tr].end()||a==b){
						continue;
					}
					trd[tr].erase(b);
					par[b]=a;
					trd[a].insert(b);
					ops.pb({-1,b});
					found=1;
					break;
				}
				a=p;
			}
			if(found)
				continue;
			if(trd[tr].find(a)!=trd[tr].end()){
				while(b!=par[b]){
					b=par[b];
					if(trd[tr].find(b)==trd[tr].end()||a==b){
						continue;
					}
					trd[tr].erase(a);
					par[a]=b;
					trd[b].insert(a);
					ops.pb({-1,a});
					found=1;
					break;
				}
				a=p;
			}
		}
		if(sz(decica[tr])==0){
			reverse(all(ordering));
		}
		//cout << trd[tr] << endl;
		vector<int> del;
		for(auto p:trd[tr]){
			if(decica[tr].find(p)==decica[tr].end()){
				del.pb(p);
			}
		}
		if(sz(del)){
			for(int i=1;i<sz(del);i++){
				trd[tr].erase(del[i]);
				par[del[i]]=del[0];
				trd[del[0]].insert(del[i]);
				ops.pb({-1,del[i]});
			}
			ops.pb({del[0],tr});
			par[del[0]]=del[0];
			pars.pb(del[0]);
			trd[tr].erase(del[0]);
		}
	}
	/*for(int i=0;i<n;i++){
		printf("%i ",par[i]);
	}
	printf("\n");*/
	bool isti=1;
	for(int i=0;i<n;i++){
		if(par[i]!=trebapar[i]){
			isti=0;
			break;
		}
	}
	//if(tt<100){
		if(!isti){
			printf("NO\n");
		}
		else{
			printf("YES\n%i\n",sz(ops));
			reverse(all(ops));
			for(auto p:ops){
				if(p.f==-1){
					printf("1 %i\n",p.s+1);
				}
				else{
					printf("2 %i %i\n",p.f+1,p.s+1);
				}
			}
		}
	//}
}
int main()
{
	int t=ri();
	for(int ind=0;ind<t;ind++){
		test(ind,t);
	}
	return 0;
}