#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<stack>
using namespace std;

const int N=3e6+10;
int t,n,cnt,head[N];
int ind,dfn[N],low[N],tot,instack[N],belong[N],size[N],vis[N];
int ans;
struct node{
	int to,next;
}a[N];
stack<int>s;

inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')w=-1;
		ch=getchar();
	}
	while(ch<='9'&&ch>='0'){
		s=s*10+ch-'0';
		ch=getchar();
	}
	return s*w;
}
inline void add(int u,int v){
	++cnt;
	a[cnt].to=v;
	a[cnt].next=head[u];
	head[u]=cnt;
}
inline void tarjan(int x){
	dfn[x]=low[x]=++ind;
	instack[x]=1;
	s.push(x);
	for(int i=head[x];i;i=a[i].next){
		int v=a[i].to;
		if(!dfn[v]){
			tarjan(v);
			low[x]=min(low[x],low[v]);
		}else if(instack[v])low[x]=min(low[x],dfn[v]);
	}
	int k=0;
	if(low[x]==dfn[x]){
		++tot;
		do{
			k=s.top();s.pop();
			belong[k]=tot;
			instack[k]=0;
			++size[tot];
			vis[k]=1;
			vis[N]=1;
		}while(k!=x);
		if(size[tot]==1)vis[x]=0;
	}
} 

int main(){
	t=read();
	while(t--){
		cnt=ind=tot=ans=0;
		memset(head,0,sizeof(head));
		memset(dfn,0,sizeof(dfn));
		memset(low,0,sizeof(low));
		memset(instack,0,sizeof(instack));
		memset(belong,0,sizeof(belong));
		memset(size,0,sizeof(size));
		memset(vis,0,sizeof(vis));
		while(!s.empty())s.pop();
		n=read();
		int maxn=0;
		for(int i=1;i<=n;i++){
			int x=read();
			add(n+x,i);
			maxn=max(maxn,x);
		}
		for(int i=1;i<=n;i++){
			int x=read();
			add(i,n+x);
		}
		for(int i=1;i<=maxn;i++)for(int j=2;j*i<=maxn;j++)add(n+i,n+i*j);
		for(int i=1;i<=n;i++)if(!dfn[i])tarjan(i);
		//for(int i=1;i<=n;i++)cout<<belong[i]<<" ";cout<<endl<<endl;
		//for(int i=1;i<=tot;i++)cout<<size[i]<<" ";cout<<endl<<endl;
		for(int i=1;i<=n;i++)if(vis[i])++ans;
		cout<<ans<<endl;
	}
	return 0;
}

跑样例输出结果都大1，减1输出 反而全WA了