#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
const int maxn = 3e5 + 10;
int n, m, mini = 0;
int x[maxn];
int y[maxn];
int xs[maxn];
int ys[maxn];
vector <int> v;
vector <int> hull;
ll ccw(int xa, int ya, int xb, int yb, int xc, int yc){
return (ll)xa * (yb - yc) + (ll)xb * (yc - ya) + (ll)xc * (ya - yb);
}
bool cmp(int a, int b){
return ccw(xs[mini], ys[mini], xs[a], ys[a], xs[b], ys[b]) > 0;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 0; i < n; i++){
cin >> x[i] >> y[i];
}
cin >> m;
for(int i = 0; i < m; i++){
cin >> xs[i] >> ys[i];
if(ys[i] < ys[mini] || ys[i] == ys[mini] && xs[i] < xs[mini]) mini = i;
}
for(int i = 0; i < m; i++){
if(i != mini) v.push_back(i);
}
sort(v.begin(), v.end(), cmp);
hull.push_back(mini);
for(int i = 0; i < m - 1; i++){
while(hull.size() >= 2 && ccw(xs[hull[hull.size() - 2]], ys[hull[hull.size() - 2]], xs[hull.back()], ys[hull.back()], xs[v[i]], ys[v[i]]) <= 0){
hull.pop_back();
}
hull.push_back(v[i]);
}
int h = hull.size();
int mini2 = 0;
for(int i = 0; i < n; i++){
if(y[i] < y[mini2] || y[i] == y[mini2] && x[i] < x[mini2]) mini2 = i;
}
int p = 0, q = (mini2 + 1) % n;
ll povr = 0, maks = 0;
for(int i = mini2; i < mini2 + n; i++){
while(ccw(x[i % n], y[i % n], xs[hull[p]], ys[hull[p]], xs[hull[(p + 1) % h]], ys[hull[(p + 1) % h]]) < 0){
p++;
p %= h;
}
while(ccw(x[i % n], y[i % n], xs[hull[p]], ys[hull[p]], x[(q + 1) % n], y[(q + 1) % n]) < 0){
povr += ccw(x[i % n], y[i % n], x[q], y[q], x[(q + 1) % n], y[(q + 1) % n]);
q++;
q %= n;
}
//cout << i % n << ' ' << q << ' ' << p << endl;
maks = max(maks, povr);
povr -= ccw(x[i % n], y[i % n], x[(i + 1) % n], y[(i + 1) % n], x[q], y[q]);
}
cout << maks;
return 0;
}
