There is a battle between two wrestling teams Team KK and Team Harv headed by Kartik Sir and Harshvardhan Sir respectively. Each team has N members , and each member a strength level . Each member of both the teams takes part in one duel each . In a duel , a member of one team fights with any member of the other team . The person with the higher strength wins and gets 2 points for his team and the loser gets no points .If the strength of both the players is same , it is declared a draw and both get 1 point for their respective teams. By an anonymous tip , Kartik Sir gets to know the strengths of all the wrestlers of team Harv . You have to help Kartik Sir find the maximum no. of points they can win .

Input

The first line contains a single integer T, denoting the number of test cases. Each case starts with a line containing an integer N. The next line contains N space separated integers denoting the strength level of the players of Kartik Sir's team. The next line also contains N space separated integers denoting the strength level of the players of the opposite team.

Output

For each case, print the maximum number of points kartik sir'team can score.

Constraints

1 <= T <= 10

1 <= N <= 500

Each of the strength level lies in the range [0, 1000].