#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	int n, m;

	cin >> n;
	vector<int> a(n);

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

	sort(a.begin(), a.end());

	cin >> m;
	vector<int> b(m);

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

	sort(b.begin(), b.end());

	int sum, max_sum = 0;
	cin >> sum;

	int j = m - 1;
	for (int i = 0; i < n; i++) {
		while (j > 0 && a[i] + b[j] > sum) {
			j--;
		}
		if (a[i] + b[j] <= sum) {
			max_sum = max(max_sum, a[i] + b[j]);
		}

	}

	cout << max_sum << endl;

	return 0;
}