#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
 
int main() {
	// your code goes here
	int t, n, arr[105], dep[105], hr, count, max;
	scanf("%d", &t);
	while(t--) {
		scanf("%d", &n); hr=0; count=0; max=0;
		for(int i=0; i<n; i++) scanf("%d", &arr[i]);
		for(int i=0; i<n; i++) scanf("%d", &dep[i]);
		while(hr<1005) {
			for(int i=0; i<n; i++) {
			if(hr==arr[i]) count++; if(count>max) max=count;
			if(hr==dep[i]) count--; 
			} hr++;
		}
		printf("%d\n", max);
	}
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y3N0ZGlvPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgdCwgbiwgYXJyWzEwNV0sIGRlcFsxMDVdLCBociwgY291bnQsIG1heDsKCXNjYW5mKCIlZCIsICZ0KTsKCXdoaWxlKHQtLSkgewoJCXNjYW5mKCIlZCIsICZuKTsgaHI9MDsgY291bnQ9MDsgbWF4PTA7CgkJZm9yKGludCBpPTA7IGk8bjsgaSsrKSBzY2FuZigiJWQiLCAmYXJyW2ldKTsKCQlmb3IoaW50IGk9MDsgaTxuOyBpKyspIHNjYW5mKCIlZCIsICZkZXBbaV0pOwoJCXdoaWxlKGhyPDEwMDUpIHsKCQkJZm9yKGludCBpPTA7IGk8bjsgaSsrKSB7CgkJCWlmKGhyPT1hcnJbaV0pIGNvdW50Kys7IGlmKGNvdW50Pm1heCkgbWF4PWNvdW50OwoJCQlpZihocj09ZGVwW2ldKSBjb3VudC0tOyAKCQkJfSBocisrOwoJCX0KCQlwcmludGYoIiVkXG4iLCBtYXgpOwoJfQoJcmV0dXJuIDA7Cn0=

NAozCjEgMiAzCjQgNSA2CjUKMSAyIDMgNCA1CjIgMyA0IDUgNgo3CjEzIDYgNSA4IDIgMTAgMTIKMTkgMTggNiA5IDkgMTEgMTUKNQoxIDQgMSAzIDUgCjkgNCAxMiA4IDEw

4
3
1 2 3
4 5 6
5
1 2 3 4 5
2 3 4 5 6
7
13 6 5 8 2 10 12
19 18 6 9 9 11 15
5
1 4 1 3 5 
9 4 12 8 10