solution
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<long long> ans;
int main()
{
long long n;
cin >> n;
for (long long i = 0; i < n; i++)
{
long long x;
cin >> x;
ans.push_back(x);
}
long long m;
cin >> m;
for (long long i = 0; i < m; i++)
{
long long x;
cin >> x;
ans.push_back(x);
}
sort(ans.begin(), ans.end());
if (ans.size()% 2 == 0)
cout << ans[ans.size() / 2 - 1];
else
cout << ans[ans.size() / 2];
}