1037

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long INT;
int main()
{
	vector<INT> C, B;
	int n, m;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		INT a;
		//cin >> a;
		scanf("%lld", &a);
		C.push_back(a);
	}
	sort(C.begin(), C.end());
	cin >> m;
	for (int i = 0; i < m; i++)
	{
		INT a;
		//cin >> a;
		scanf("%lld", &a);
		B.push_back(a);
	}
	sort(B.begin(), B.end());
	INT ans = 0;
	int i, j;
	i = j = 0;
	int Lc, Lb;
	Lc = C.size();
	Lb = B.size();
	while ( i < Lc&&j < Lb&&C[i] < 0 && B[j] < 0  )
	{
		ans += (C[i] * B[j]);
		i++;
		j++;
	}
	i = Lc - 1;
	j = Lb - 1;
	while ( i >= 0 && j >= 0 && C[i] > 0 && B[j] > 0  )
	{
		ans += (C[i] * B[j]);
		i--;
		j--;
	}
	cout << ans << endl;

	//printf("%lld\n", ans);
	system("pause");
	return 0;

}