#include <iostream>
#include <algorithm>
#include <cstring>
#define FOR(i,a,b) for ( int i = int(a); i <= int(b); ++i )
#define FORD(i,a,b) for ( int i = int(a); i >= int(b); --i )
#define REP(i,n) for ( int i = 0; i < int(n); ++i )
using namespace std;

int row[102];
int col[102];

int M[102][102];

bool usedR[102], usedL[102];
int miniR[102], miniL[102];
int n, t;

bool isCovered( int r2, int c2 ) {
	bool row = false, col = false;
	REP( r, n )
		if ( r != r2 && M[r][c2] >= M[r2][c2] ) {
			row = true;
			break;
		}
	REP( c, n )
		if ( c != c2 && M[r2][c] >= M[r2][c2] ) {
			col = true;
			break;
	}
	return row && col;
}

int main( ) {

ios::sync_with_stdio( 0 );
  cin >> t;
  while ( t-- ) {
   cin >> n;
   memset(usedR, 0, sizeof(usedR));
   memset(usedL, 0, sizeof(usedL));
   for ( int i = 0; i<n; i++) {
     miniR[i] = miniL[i] = 10000000;
   }
    for ( int i = 0; i<n; i++)
     cin >> row[i];
    for ( int i = 0; i<n; i++)
      cin >> col[i];

   unsigned long long top = 0;
    for ( int i = 0; i<n; i++) {
      for ( int j = 0; j<n; j++) {
        M[i][j] = min(row[i], col[j]);
        top += M[i][j];
        /*if ( M[i][j])
        miniR[i] = min(miniR[i], M[i][j]);*/
      }  
    }
    /*for ( int i = 0; i<n; i++){ 
      for ( int j = 0; j<n; j++) 
         if (M[j][i])
           miniL[i] = min(miniL[i], M[j][i]);
      }*/


    int x=0,y=0;
    unsigned long long low = 0;

		/*REP( r, n ) {
			REP( c, n ) {
				cout << M[c][r] << " ";
			}
			cout << endl;
		}*/
  
		REP( r, n )
			REP( c, n )
				M[r][c] = ( row[r] == col[c] ) ? row[r] : 0;
		REP( r, n )
			REP( c, n ) {
				REP( r2, n )
					if ( r2 != r && isCovered( r2, c ) )
						M[r2][c] = 0;
				REP( c2, n )
					if ( c2 != c && isCovered( r, c2 ) )
						M[r][c2] = 0;
			}
		REP( c, n ) {
			REP( r, n ) {
				low += M[r][c];
				//cout << M[r][c] << " ";
			}
			//cout << endl;
		}
		/*
		int maxi; 
    do {
      maxi = 0;
      for ( int i = 0; i<n; i++)
        for ( int j = 0; j<n; j++)
           if ( M[i][j] > maxi) {
             maxi = M[i][j];
             x = i;
							y = j;
           }  
      low += maxi;
      for ( int i = 0; i<n; i++ ) {
         M[x][i] = 0;
         M[i][y] = 0;
         usedR[x] = 1;
         usedL[y] = 1;
      }
   } while (maxi>0);

   
   for ( int i = 0; i<n; i++) {
     if ( usedR[i] == 0 && miniR[i] < 1000000)
       low += miniR[i];
     if ( usedL[i] == 0 && miniL[i] < 1000000)
       low += miniL[i];
   }*/
   cout << "Minimalni budova obsahuje "<<low<<" kostek, maximalni "<<top << " kostek." << endl;
}


return 0;
}