#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	int N, K, x, minVal, maxVal;
	vector<int> front, right;
	scanf("%d", &N);
	for (int i = 0; i<N; i++) {
		scanf("%d", &K);
		for (int j = 0; j<K; j++) {
			scanf("%d", &x);
			front.push_back(x);
		}
		for (int j = 0; j<K; j++) {
			scanf("%d", &x);
			right.push_back(x);
		}
		sort(front.begin(), front.end());
		sort(right.begin(), right.end());
		vector<int> rowF(front.back()+1, 0), rowR(front.back()+1, 0);
		for (int j = 0; j<K; j++) {
			rowF[front[j]]++;
			rowR[right[j]]++;
		}
		minVal = 0;
		for (int j = 1; j <= front.back(); j++) {
			minVal += (j)*max(rowF[j], rowR[j]);
		}
		for (int j = front.back()-1; j>=0; j--) {
			rowF[j] += rowF[j+1];
			rowR[j] += rowR[j+1];
		}
/*
		for (int j = 0; j<K; j++) {
			minVal += (front[j] == right[j]) ? front[j] : (front[j] + right[j]);
		}
*/
		maxVal = 0;
		for (int j =1; j<= front.back(); j++) {
			maxVal += rowF[j]*rowR[j];
		}
/*		for (int j = 0; j<K; j++) {
			for (int k = 0; k<right[j]; k++) row[k]++;
		}
for (int j = 0; j<front.back(); j++) printf("%d ",row[j]);
		for (int j = 0; j<K; j++) {
			for (int k = 0; k<front[j]; k++) maxVal += row[k];
		}
/ * /
		int idxR = 0, idxF = 0;
		for (int j =0; j< front.back(); j++) {
			while (idxF<K && front[idxF] <= j) idxF++;
			while (idxR<K && right[idxR] <= j) idxR++;
			maxVal += (K-idxF)*(K-idxR);
		}
//*/
		printf("Minimalni budova obsahuje %d kostek, maximalni %d kostek.\n",minVal, maxVal);
		front.clear();
		right.clear();
	}
	return 0;
}