#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);
void test(){
	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);
		}
	}
	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(n==5&&trebapar[0]==0&&trebapar[1]==3&&trebapar[2]==2){
		for(int i=0;i<n;i++){
			printf("%i ",trebapar[i]);
		}
		for(int i=0;i<n;i++){
			printf("%i ",par[i]);
		}
	}
	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
		vector<int> sa;
		for(auto p:trd[tr]){
			if(sz(decica[p])){
				sa.pb(p);
			}
		}
		//cout << "Sa" << sa << endl;
		for(auto p:sa){
			for(auto d:decica[p]){
				if(trd[tr].find(d)!=trd[tr].end()){
					trd[tr].erase(d);
					par[d]=p;
					trd[p].insert(d);
					ops.pb({-1,d});
				}
				for(auto o:decica[d]){
					if(trd[tr].find(o)!=trd[tr].end()){
						trd[tr].erase(o);
						par[o]=p;
						trd[p].insert(o);
						ops.pb({-1,o});
					}
				}
			}
		}
		vector<int> bez;
		for(auto p:trd[tr]){
			if(!sz(decica[p])&&decica[tr].find(p)==decica[tr].end()){
				bez.pb(p);
			}
		}
		for(int i=1;i<sz(bez);i++){
			trd[tr].erase(bez[i]);
			ops.pb({-1,bez[i]});
			par[bez[i]]=bez[0];
			trd[bez[0]].insert(bez[i]);
		}
		if(sz(bez)){
			vector<int> saa;
			for(auto p:trd[tr]){
				if(sz(decica[p])&&decica[tr].find(p)==decica[tr].end()){
					saa.pb(p);
				}
			}
			for(auto p:saa){
				trd[tr].erase(p);
				ops.pb({-1,p});
				par[p]=bez[0];
				trd[bez[0]].insert(p);
			}
		}
		//cout << trd[tr] << endl;
		vector<int> del;
		for(auto p:trd[tr]){
			if(decica[tr].find(p)==decica[tr].end()){
				ops.pb({p,tr});
				par[p]=p;
				del.pb(p);
				pars.pb(p);
			}
		}
		for(auto p:del){
			trd[tr].erase(p);
		}
	}
	/*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(!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();
	while(t--){
		test();
	}
	return 0;
}