//
//  main.cpp
//  olymp_in
//
//  Created by Kadir Kadyrov on 19.10.2020.
//  Copyright © 2020 Kadir Kadyrov. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <queue>
#include <map>
#include <vector>
#include <stack>


using namespace std;

int main() {
    int n, m;
    cin >> n;
    int a[n];

    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    cin >> m;
    int b[m];
    for (int i = 0; i < m; i++) {
        cin >> b[i];
    }

    sort(a, a + n);
    sort(b, b + m);

    cout << a[n - 1] << ' ' << b[m - 1] << endl;
}


//var2----------------------------------

//
//  main.cpp
//  olymp_in
//
//  Created by Kadir Kadyrov on 19.10.2020.
//  Copyright © 2020 Kadir Kadyrov. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <queue>
#include <map>
#include <vector>
#include <stack>


using namespace std;

int main() {
    int n, m;
    cin >> n;
    int a[n];

    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    cin >> m;
    int b[m];
    for (int i = 0; i < m; i++) {
        cin >> b[i];
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            int x = a[i] + b[j];

            bool flag = false;

            for (int k = 0; k < n; k++) {
                if (a[k] == x) {
                    flag = true;
                }
            }

            for (int k = 0; k < m; k++) {
                if (b[k] == x) {
                    flag = true;
                }
            }

            if (flag == false) {
                cout << a[i] << ' ' << b[j] << endl;
                return 0;
            }
        }
    }
}