#include <bits/stdc++.h>
using namespace std;
const int N = 1e2+10;
int A[N], B[N], a, b, sa, sb;
int found[N];
vector<pair<int, int>> v;
bool arr[N];
int main() {
scanf("%d", &sa);
memset(arr, 0, sizeof arr);
for(int i = 0 ; i < sa ; ++i){
scanf("%d", A+i);
arr[i] = 1;
}
scanf("%d", &sb);
for(int i = 0 ; i < sb ; ++i){
scanf("%d", B+i);
arr[i] = 1;
}
for(int i = 0 ; i < sa ; ++i){
for(int j = 0 ; j < sb ; ++j){
int sum = A[i] + B[j];
//int x = lower_bound(A, A+sa, )
if(arr[A[i] + B[j]] == 0 ){
printf("%d %d", A[i], B[j]);
return 0;
}
}
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKY29uc3QgaW50IE4gPSAxZTIrMTA7CmludCBBW05dLCBCW05dLCBhLCBiLCBzYSwgc2I7CmludCBmb3VuZFtOXTsKdmVjdG9yPHBhaXI8aW50LCBpbnQ+PiB2Owpib29sIGFycltOXTsKIAppbnQgbWFpbigpIHsKCXNjYW5mKCIlZCIsICZzYSk7CgltZW1zZXQoYXJyLCAwLCBzaXplb2YgYXJyKTsKCWZvcihpbnQgaSA9IDAgOyBpIDwgc2EgOyArK2kpewoJCXNjYW5mKCIlZCIsIEEraSk7CgkJYXJyW2ldID0gMTsKCX0KCXNjYW5mKCIlZCIsICZzYik7Cglmb3IoaW50IGkgPSAwIDsgaSA8IHNiIDsgKytpKXsKCQlzY2FuZigiJWQiLCBCK2kpOwoJCWFycltpXSA9IDE7Cgl9CQoJCglmb3IoaW50IGkgPSAwIDsgaSA8IHNhIDsgKytpKXsKCQlmb3IoaW50IGogPSAwIDsgaiA8IHNiIDsgKytqKXsKCQkJaW50IHN1bSA9IEFbaV0gKyBCW2pdOwoJCQkvL2ludCB4ID0gbG93ZXJfYm91bmQoQSwgQStzYSwgKQoJCQlpZihhcnJbQVtpXSArIEJbal1dID09IDAgKXsKCQkJCXByaW50ZigiJWQgJWQiLCBBW2ldLCBCW2pdKTsKCQkJCXJldHVybiAwOwoJCQl9CgkJfQoJfQoJcmV0dXJuIDA7Cn0=