#P2073. PostscriptofTianJiracing

PostscriptofTianJiracing

Acm's LN students, recently learned Tian Ji horse greedy strategy,In order to test his learning results,the captain called NL to play cards,when entertainment after training 。
The rules are simple.There are 52 cards,The players sit on opposite sides of a table, facing each other. Each player gets k cards from the deck and, after looking at them, places the cards face down in a row on the table. the captain’s cards are numbered from 1 to k from his left, and LN’s cards are numbered 1 to k from his right (so capital’s i:th card is opposite LN’s i:th card). The cards are turned face up, and points are awarded as follows (for each i ∈ {1, . . . , k}):
who’s i:th card beats the other’s i:th card,  gets one point.
A card with higher value always beats a card with a lower value: a three beats a two, a four beats a three and a two, etc. An ace beats every card except (possibly) another ace.
If the two i:th cards have the same value, then the suit determines who wins: hearts beats all other suits, spades beats all suits except hearts, diamond beats only clubs, and clubs does not beat any suit.

For example, the ten of spades beats the ten of diamonds but not the Jack of clubs.
The good captain let LN know the display order of own brand。In other words, LN knows which cards the captain has on the table before he turns them face up. Using this information LN orders her own cards so that she gets as many points as possible.
But now, LN is still a headache! Now your task is to, given the captain’s and LN’s cards, help LN select a method(Change the LN’s cards’ order), to get the highest score to win。

Input

There will be several test cases. The first line of input will contain a single positive integer N giving the number of test cases. After that line follow the test cases.

Each test case starts with a line with a single positive integer k <= 26 which is the number of cards each player gets. The next line describes the k cards the capital has placed on the table, left to right. The next line describes the k cards Eve has (but she has not yet placed them on the table). A card is described by two characters, the first one being its value (2, 3, 4, 5, 6, 7, 8 ,9, T, J, Q, K, or A), and the second one being its suit (C, D, S, or H). Cards are separated by white spaces. So if LN’s cards are the ten of clubs, the two of hearts, and the Jack of diamonds, that could be described by the line

Such as:
TC 2H JD

Output

For each test case output a single line with the number of points LN gets if he picks the optimal way to arrange his cards on the table.

Sample Input

3 
1
JD 
JH 
2 
5D TC
4C 5H
3 
2H 3H 4H 
2D 3D 4D

Sample Output

1 
1 
2

HINT

Source