#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <queue>

using namespace std;
#define FOR(i,n) for(int i = 0; i < n; i++)
int main(void){
	int n;
	int oneSide[100];
	int secondSide[100];
	int problem[100];

	scanf(" %d", &n);
	FOR(isatac,n){
		int k;
		scanf(" %d", &k);
		FOR(i, k){
			scanf(" %d", &oneSide[i]);
		}
		FOR(i, k){
			scanf(" %d", &secondSide[i]);
		}
		int max = 0;

		FOR(i, k){
			FOR(j,k){
				max += min(oneSide[i], secondSide[j]);
			}
		}
		int min = 0;
		int problems = 0;
		FOR(i ,k){
			FOR(j,k){
				if(oneSide[i] == secondSide[j]){
					min += oneSide[i];
				}
			}
		}

		printf("Minimalni budova obsahuje %d kostek, maximalni %d kostek\n", min, max);
	}
	return 0;
}