///公共最长上升子序列

#include <iostream>

#include <stdio.h>

#include <string.h>

#include <stdlib.h>

#include <math.h>

#include <algorithm>

#define N 505

using namespace std;

int dp[N][N],flag[N][N];

int dp1[N];

int a[N],b[N],c[N];

int n,m,k;

void solve_c(int i,int j){

    if(i==||j==) return;

    if(flag[i][j]==){

        solve_c(i-,j-);

        c[++k] = a[i];

    }else if(flag[i][j]==){

        solve_c(i-,j);

    }else solve_c(i,j-);

}

void LCS(){

    memset(flag,,sizeof(flag));

    for(int i=;i<=n;i++){

        for(int j=;j<=m;j++){

            if(a[i]==b[j]){

                dp[i][j] = dp[i-][j-]+;

                flag[i][j]=;

            }else{

                if(dp[i-][j]>dp[i][j-]) flag[i][j]=;

                else flag[i][j]=-;

                dp[i][j] = max(dp[i-][j],dp[i][j-]);

            }

        }

    }

    //printf("%d",dp[n][m]);

    k = ;

    solve_c(n,m);

    //for(int i=1;i<=k;i++) printf("%d ",c[i]);

}

void LIS(){

    dp1[] = ;

    int mx = ;

    for(int i=;i<=k;i++){

        dp1[i]=;

        for(int j=;j<i;j++){

            if(c[i]>c[j]&&dp1[i]<dp1[j]+){

                dp1[i] = dp1[j]+;

            }

            if(mx<dp1[i]) mx=dp1[i];

        }

    }

    if(k==) mx = ;

    printf("%d\n",mx);

}

int main()

{

    int tcase;

    scanf("%d",&tcase);

    while(tcase--){

        scanf("%d",&n);

        for(int i=;i<=n;i++){

            scanf("%d",&a[i]);

        }

        scanf("%d",&m);

        for(int i=;i<=m;i++){

            scanf("%d",&b[i]);

        }

        memset(dp,,sizeof(dp));

        LCS();

        LIS();

        if(tcase) printf("\n");

    }

    return ;

}

#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

const int maxn = ;

int a[maxn],b[maxn],dp[maxn];

int n,m;

int LICS()

{

    int i,j,MAX;

    memset(dp,,sizeof(dp));

    for(i = ; i<=n; i++)

    {

        MAX = ;

        for(j = ; j<=m; j++)

        {

            if(a[i]>b[j] && MAX<dp[j])

                MAX = dp[j];

            if(a[i]==b[j])

                dp[j] = MAX+;

        }

    }

    MAX = ;

    for(i = ; i<=m; i++)

        if(MAX<dp[i])

            MAX = dp[i];

    return MAX;

}

int main()

{

    int tcase;

    scanf("%d",&tcase);

    while(tcase--){

        scanf("%d",&n);

        for(int i=;i<=n;i++){

            scanf("%d",&a[i]);

        }

        scanf("%d",&m);

        for(int i=;i<=m;i++){

            scanf("%d",&b[i]);

        }

        int MAX = LICS();

        printf("%d\n",MAX);

        if(tcase) printf("\n");

    }

    return ;

}