#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 3e5;
struct Point
{
ll x, y;
};
Point operator + (Point p, Point q) { return {p.x+q.x, p.y+q.y}; }
Point operator - (Point p, Point q) { return {p.x-q.x, p.y-q.y}; }
ll ccw(Point p, Point q) { return p.x*q.y-p.y*q.x; }
ll dot(Point p, Point q) { return p.x*q.x+p.y*q.y; }
int N, M;
Point A[MAXN+10], B[MAXN+10];
vector<Point> UH, DH, CH;
bool f(Point p, Point q)
{
for(int i=1; i<=M; i++)
{
if(ccw(q-p, B[i]-p)<=0) return false;
}
return true;
}
ll ans=0;
int main()
{
scanf("%d", &N);
for(int i=1; i<=N; i++) scanf("%lld%lld", &A[i].x, &A[i].y);
scanf("%d", &M);
for(int i=1; i<=M; i++) scanf("%lld%lld", &B[i].x, &B[i].y);
sort(B+1, B+M+1, [&](const Point &p, const Point &q)
{
if(p.x!=q.x) return p.x<q.x;
return p.y<q.y;
});
for(int i=1; i<=M; i++)
{
while(DH.size()>1 && ccw(DH[DH.size()-1]-DH[DH.size()-2], B[i]-DH[DH.size()-2])<=0) DH.pop_back();
DH.push_back(B[i]);
}
reverse(B+1, B+M+1);
for(int i=1; i<=M; i++)
{
while(UH.size()>1 && ccw(UH[UH.size()-1]-UH[UH.size()-2], B[i]-UH[UH.size()-2])<=0) UH.pop_back();
UH.push_back(B[i]);
}
for(int i=0; i<DH.size(); i++) CH.push_back(DH[i]);
for(int i=1; i+1<UH.size(); i++) CH.push_back(UH[i]);
for(int i=1; i<=N; i++)
{
for(int j=1; j<=N; j++)
{
if(i==j) continue;
if(f(A[i], A[j]))
{
ll val=0;
for(int k=i; k!=j; k=(k==N ? 1 : k+1))
{
val+=ccw(A[k], A[(k==N ? 1 : k+1)]);
}
val+=ccw(A[j], A[i]);
val=abs(val);
ans=max(ans, val);
}
}
}
/*
for(int i=1, j=2; i<=N; i++)
{
for(; i==j || f(A[i], A[j]); j=(j==N ? 1 : j+1));
int t=j-1;
if(t==0) t=N;
ll val=0;
for(int k=i; k!=t; k=(k==N ? 1 : k+1))
{
val+=ccw(A[k], A[(k==N ? 1 : k+1)]);
}
val+=ccw(A[t], A[i]);
val=abs(val);
//printf("%d %d : %lld\n", i, t, val);
ans=max(ans, val);
}
*/
printf("%lld\n", ans);
}
