#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
vector<ll> vec[1010];
vector<pair<ll,pair<ll,ll> > > ans;
ll t,n,fa[1010],g[1010],rt[1010],cnt=0,d[1010],dfn[1010],tot=0,mp[1010];
bl ck[1010];
ll find(ll x){
	if(x==fa[x]) return x;
	return fa[x]=find(fa[x]);
}
il void topo(){
	queue<ll> q;
	fr(i,1,cnt) if(!d[rt[i]]) q.push(rt[i]);
	while(!q.empty()){
		ll u=q.front();
		q.pop();
		dfn[++tot]=u;
		mp[u]=tot;
		fr(i,0,(ll)vec[u].size()-1){
			ll v=vec[u][i];
			d[v]--;
			if(!d[v]) q.push(v);
		}
	}
}
il void clr(){
	fr(i,1,n) vec[i].clear();
	fr(i,1,n) d[i]=ck[i]=0;
	cnt=tot=0;
	ans.clear();
}
int main(){
	t=read();
	while(t--){
		n=read();
		fr(i,1,n) fa[i]=read();
		fr(i,1,n) g[i]=read(); 
		fr(i,1,n){
			if(fa[i]==i){
				rt[++cnt]=i;
				ck[i]=1;
			}
		}
		bl pd=0;
		fr(i,1,n){
			if(fa[i]!=g[i]){
				find(i);
				ans.push_back(MP(1,MP(i,0)));
				if(!ck[g[i]]) pd=1;
				else{
					vec[g[i]].push_back(fa[i]);
					d[fa[i]]++;
				}
			}
		}
		topo();
		if(cnt!=tot||pd){
			pf("NO\n");
			clr();
			continue;
		}
		pfr(i,tot,2){
			ll maxx=-inf;
			fr(j,1,n) if(fa[j]==dfn[i]&&fa[j]!=g[j]) maxx=max(maxx,mp[g[j]]);
			if(maxx!=-inf){
				fa[dfn[i]]=dfn[maxx];
				ans.push_back(MP(2,MP(dfn[i],dfn[maxx])));
			}
			fr(j,1,n){
				if(fa[j]!=g[j]){
					find(j);
					ans.push_back(MP(1,MP(j,0)));
				}
			}
		}
		fr(i,1,n) if(fa[i]!=g[i]) pd=1;
		if(pd){
			pf("NO\n");
			clr();
			continue;
		}
		pf("YES\n");
		writeln(ans.size());
		fr(i,0,(ll)ans.size()-1){
			if(ans[i].fir==1) pf("1 %lld\n",ans[i].sec.fir);
			else pf("2 %lld %lld\n",ans[i].sec.fir,ans[i].sec.sec);
		}
		clr();
	}
}