#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

char x[100][3], y[100][3];
int n, maps[100][100], used[100], vis[100];

int slove(int m, int n)
{
    int a, b;

    if(x[m][0] == ‘T‘)
        a = 10;
    else if(x[m][0] == ‘J‘)
        a = 11;
    else if(x[m][0] == ‘Q‘)
        a = 12;
    else if(x[m][0] == ‘K‘)
        a = 13;
    else if(x[m][0] == ‘A‘)
        a = 14;
    else
        a = x[m][0] - ‘0‘;
    if(y[n][0] == ‘T‘)
        b = 10;
    else if(y[n][0] == ‘J‘)
        b = 11;
    else if(y[n][0] == ‘Q‘)
        b = 12;
    else if(y[n][0] == ‘K‘)
        b = 13;
    else if(y[n][0] == ‘A‘)
        b = 14;
    else
        b = y[n][0] - ‘0‘;
    if(a > b)
        return 1;
    if(a == b)
    {
        if(x[m][1] == ‘H‘)
            return 1;
        if(x[m][1] == ‘S‘ && (y[n][1] == ‘D‘ || y[n][1] == ‘C‘))
            return 1;
        if(x[m][1] == ‘D‘ && y[n][1] == ‘C‘)
            return 1;
    }
    return 0;
}

int found(int u)
{
    for(int i = 0; i < n; i++)
    {
        if(maps[u][i] && !vis[i])
        {
            vis[i] = 1;
            if(!used[i] || found(used[i]))
            {
                used[i] = u;
                return true;
            }
        }
    }
    return false;
}

void init()
{
    memset(maps, 0, sizeof(maps));
    memset(vis, 0, sizeof(vis));
    memset(used, 0, sizeof(used));
    memset(x, 0, sizeof(x));
    memset(y, 0, sizeof(y));
}

int main()
{
    int t;

    scanf("%d", &t);
    while(t--)
    {
        int cou = 0;
        scanf("%d", &n);

        init();

        for(int i = 0; i < n; i++)
            scanf("%s", x[i]);
        for(int i = 30; i < n+30; i++)
            scanf("%s", y[i]);

        for(int i = 0; i < n; i++)
        {
            for(int j = 30; j < n+30; j++)
            {
                if(slove(i, j))
                    maps[i][j] = 1;
                else
                    maps[j][i] = 1;
            }
        }

        for(int i = 30; i < n+30; i++)
        {
            memset(vis, 0, sizeof(vis));
            if(found(i))
            {
                cou++;
            }
        }
        printf("%d\n", cou);
    }
    return 0;
}