#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <cassert>

using namespace std;
typedef unsigned long long LL;
#define FOR(k,a,b) for(int k(a); k < (b); ++k)
#define REP(k,a) for(int k=0; k < (a); ++k)
#define ABS(a) ((a)>0?(a):-(a))

int main(int argv, char** argc)
{
	int T,N;
	assert(scanf("%d",&T));
	assert(0<T && T<101);
	auto bestsplit = new short int[2002][2002];
	int a[2002],b[2002], aaa[2002],bbb[2002], loops[2002], mx, mlist[2002], ans, tmp, act, rem, di, as, st;
	bool aa[2002], bb[2002], used[2002];
	memset(bestsplit,0,sizeof bestsplit);
	FOR(i,1,2002) FOR(j,1,i)
	{
		bestsplit[i][j]=max(bestsplit[i-j-1][j]+j,(i>j+1)?bestsplit[i-j-2][j]+j+1:0);
	}

	while(T--)
	{
		assert(scanf("%d",&N)==1);
		fflush(stdout);
		assert(0<N && N<2001);
		memset(aa,0,sizeof aa);
		memset(bb,0,sizeof bb);
		memset(used,0,sizeof used);
		memset(loops,0,sizeof loops);
		REP(i,N)
		{
			assert(scanf("%d",&tmp)==1);
			a[i] = tmp -1 ;
			assert(a[i]>-1 && a[i]<N);
			assert(!aa[a[i]]);
			aa[a[i]]=1;
			aaa[a[i]]=i;
		}
		REP(i,N)
		{
			assert(scanf("%d",&tmp)==1);
			b[i] = tmp -1;
			assert(b[i]>-1 && b[i]<N);
			assert(!bb[b[i]]);
			bb[b[i]]=1;
			bbb[b[i]]=i;
		}
		REP(i,N) if(!used[i])
		{
			act = 1;
			st = a[i];
			as = b[i];
			while(as != st)
			{
				int tmp = aaa[as];
				as = b[tmp];
				used[tmp]=1;
				++act;
			}
			loops[act]++;
		}
		ans = loops[1];
		//create mlist
		tmp = 0;
		FOR(i,2,2001) if(loops[i])
		{
			mlist[tmp]=i;
			tmp=i;
		}
		mlist[tmp]=-1;
		//
		FOR(i,1,2001)
		{
			act = 0;
			tmp=mlist[0];
			while(tmp!=-1)
			{
				act += loops[tmp]*bestsplit[tmp][i];
				tmp = mlist[tmp];
			}
			ans= max(ans,act);
		}
		printf("%d\n", ans);
	}
	return 0;
}