#include<bits/stdc++.h>
using namespace std;
inline int qread()
{
	int a=0,f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
	while(isdigit(ch)){(a*=10)+=(ch^48);ch=getchar();}
	return a*f;
} 
int T,n,fa[1010],tp[1010],deg[1010],dfn[1010],pos[1010],tot;
vector<int>e[1010];
queue<int>que;
struct node
{
	int op,x,y;
};
vector<node>Ans;
inline int find(int rt){Ans.emplace_back((node){1,rt,0});return fa[rt]==rt?rt:fa[rt]=find(fa[rt]);}
inline void merge(int x,int y){Ans.emplace_back((node){2,x,y});x=find(x),y=find(y);fa[x]=y;return;}
inline void solve()
{
	n=qread();Ans.clear();memset(deg,0,(n+1)<<2);
	for(int i=1;i<=n;++i)fa[i]=qread();
	for(int i=1;i<=n;++i)tp[i]=qread();
	for(int i=1;i<=n;++i)
	{
		if(fa[i]^tp[i])find(i);
		if(fa[i]^tp[i])e[fa[i]].emplace_back(tp[i]),++deg[tp[i]];
	}
	while(!que.empty())que.pop();tot=0;
	for(int i=1;i<=n;++i)if(!deg[i])que.push(i);
	while(!que.empty())
	{
		int p=que.front();que.pop();
		pos[dfn[p]=++tot]=p;
		for(int i:e[p])if(!--deg[i])que.push(i);
	}
	for(int i=1;i<=n;++i)vector<int>().swap(e[i]);
	if(tot^n)return puts("NO"),void();
	dfn[0]=n+1;
	for(int i=1,p,lp;i<=n;++i)
	{
		p=pos[i],lp=0;
		for(int j=1;j<=n;++j)if(fa[j]==p&&fa[j]^tp[j]&&dfn[lp]>dfn[tp[j]])lp=tp[j];
		if(lp)merge(p,lp);
		for(int j=1;j<=n;++j)if(fa[j]^tp[j])find(j);
	}
	for(int i=1;i<=n;++i)if(fa[i]^tp[i])return puts("NO"),void();
	puts("YES");
	printf("%d\n",(int)Ans.size());
	for(node i:Ans)
	{
		if(i.op==1)printf("1 %d\n",i.x);
		else printf("2 %d %d\n",i.x,i.y);
	}
	return ;
}
int main()
{
	T=qread();
	while(T--)solve();
	return 0;	
}