#include <iostream>

using namespace std;

int main()
{
    int n_TestCases = 0;
    cin >> n_TestCases;
    for (int i = 0; i<n_TestCases; i++) {
        int k_size = 0;
        cin >> k_size;
        bool cube[k_size][k_size][k_size];
        bool cube1[k_size][k_size][k_size];
        bool cube2[k_size][k_size][k_size];

        for (int j = 0; j < k_size; j++) {
            for (int k = 0; k < k_size; k++) {
                for (int l = 0; l < k_size; l++) {
                    cube[j][k][l] = 0;
                    cube1[j][k][l] = 0;
                    cube2[j][k][l] = 0;
                }
            }
        } //vynulovay array
        //0 znamena ze tam kocka nie je, 1 ze ano

        //2d pole k_size*k_size
        int prednyPohlad[k_size];
        int zpravaPohlad[k_size];
        for (int j = 0; j < k_size; j++) {
            prednyPohlad[j] = 0;
            zpravaPohlad[j] = 0;
        }
        for (int j = 0; j < k_size; j++) {
            cin >> prednyPohlad[j];
        }

        for (int j = 0; j < k_size; j++) {
            cin >> zpravaPohlad[j];
        }
/*
        int front[k_size][k_size];
        int right[k_size][k_size];
        for (int j = 0; j < k_size; j++) {
            for (int k = 0; k < prednyPohlad[j]; k++) {
                front[j][k] = 1;
            }
        }
        for (int j = 0; j < k_size; j++) {
            for (int k = 0; k < zpravaPohlad[j]; k++) {
                right[j][k] = 1;
            }
        }
*/


        //naplnit zpredu
        for (int j = 0; j <k_size; j++) {
            for (int k = 0; k < prednyPohlad[j]; k++) {
                for (int l = 0; l < k_size; l++) {
                    cube1[j][k][l] = 1;
                }
            }
        }

        //naplnit zprava
        for (int j = 0; j <k_size; j++) {
            for (int k = 0; k < zpravaPohlad[j]; k++) {
                for (int l = 0; l < k_size; l++) {
                    cube2[j][k][l] = 1;
                }
            }
        }

        //odstranit co nesedi zprava => maximalne
        for (int j = 0; j <k_size; j++) {
            for (int k = 0; k < k_size; k++) {
                for (int l = 0; l < k_size; l++) {
                    if (cube1[j][k][l] == 1 && cube2[l][k][j] == 1) {
                        cube[j][k][l] = 1;
                    } else {
                        cube[j][k][l] = 0;
                    }
                }
            }
        }
        int m_cubes = 0;
        for (int j = 0; j <k_size; j++) {
            for (int k = 0; k < k_size; k++) {
                for (int l = 0; l < k_size; l++) {
                    if (cube[j][k][l] == 1) {
                        m_cubes++;
                    }
                }
            }
        }

        int l_cubes = 0;
        int tmp1 = 0;
        int tmp2 = 0;
        for (int j = 0; j < k_size; j++) {
            tmp1 += prednyPohlad[j];
            tmp2 += zpravaPohlad[j];
        }
        if (tmp2 > tmp1) {
            l_cubes = tmp2;
        } else {
            l_cubes = tmp1;
        }
        cout << "Minimalni budova obsahuje " << l_cubes << " kostek, maximalni " << m_cubes << " kostek." << endl;

    }
    return 0;
}