#include <bits/stdc++.h>

using namespace std;

int main() {

    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        vector<int> a(n), b(n);
        for (auto &it : a) cin >> it;
        for (auto &it : b) cin >> it;
        int mna = *min_element(a.begin(), a.end());
        int mnb = *min_element(b.begin(), b.end());

        /*sort(a.begin(),a.end());
        sort(b.begin(),b.end());
        int mna=a[0],mnb=b[0];*/

        long long ans = 0;
        for (int i = 0; i < n; ++i) {
            ans += max(a[i] - mna, b[i] - mnb);
        }
        cout<<endl;
        cout<<mna<<" "<<mnb<<endl<<endl;
        cout << ans << endl;
    }

    return 0;
}