#include <bits/stdc++.h>
using namespace std;
 
void solve() {
	int n;
	cin >> n;
	unordered_set<int> a(n), b(n);
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		if (a.find(x) == a.end()) a.insert(x);
	}
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		if (b.find(x) == b.end()) b.insert(x);
	}
	if (a.size() + b.size() >= 4) cout << "YES" << endl;
	else cout << "NO" << endl;
}	
 
int main() {
	int t;
	cin >> t;
	while (t--) solve();
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2b2lkIHNvbHZlKCkgewoJaW50IG47CgljaW4gPj4gbjsKCXVub3JkZXJlZF9zZXQ8aW50PiBhKG4pLCBiKG4pOwoJZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKCQlpbnQgeDsKCQljaW4gPj4geDsKCQlpZiAoYS5maW5kKHgpID09IGEuZW5kKCkpIGEuaW5zZXJ0KHgpOwoJfQoJZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKCQlpbnQgeDsKCQljaW4gPj4geDsKCQlpZiAoYi5maW5kKHgpID09IGIuZW5kKCkpIGIuaW5zZXJ0KHgpOwoJfQoJaWYgKGEuc2l6ZSgpICsgYi5zaXplKCkgPj0gNCkgY291dCA8PCAiWUVTIiA8PCBlbmRsOwoJZWxzZSBjb3V0IDw8ICJOTyIgPDwgZW5kbDsKfQkKCmludCBtYWluKCkgewoJaW50IHQ7CgljaW4gPj4gdDsKCXdoaWxlICh0LS0pIHNvbHZlKCk7Cn0=

NQo0CjEgMiAxIDIKMSAyIDEgMgo2CjEgMiAzIDMgMiAxCjEgMSAxIDEgMSAxCjMKMSAxIDEKMSAxIDEKNgoxIDUyIDUyIDMgMSAzCjU5IDQgMyA1OSAzIDQKNAoxMDAgMSAxMDAgMQoyIDIgMiAyCg==

5
4
1 2 1 2
1 2 1 2
6
1 2 3 3 2 1
1 1 1 1 1 1
3
1 1 1
1 1 1
6
1 52 52 3 1 3
59 4 3 59 3 4
4
100 1 100 1
2 2 2 2