#include <cstdio>
#include <utility>
#include <map>
#include <algorithm>
using namespace std;
typedef pair<int,int> pi;
int x[2505], y[2505], hole[2505], n;
map<pi,int> mp;
int h;
int res;
int f(int s, int e){
if(s >= e) return 0;
int pos = (int)(min_element(y+s,y+e)-y);
int ph = h, ret = 0;
h = y[pos];
int r = f(s,pos);
r |= f(pos+1,e);
if(hole[pos] == 0 && !r){
res += (x[e] - x[s]) * (y[pos] - ph);
ret = 0;
}
else ret = 1;
h = ph;
return ret;
}
int main(){
scanf("%d",&n);
n/=2;
for (int i=0; i<n; i++) {
scanf("%*d %*d %d %d",&x[i],&y[i]);
mp[pi(x[i],y[i])] = i;
}
int t;
scanf("%d",&t);
for (int i=0; i<t; i++) {
int s,e;
scanf("%d %d %*d %*d",&s,&e);
hole[mp[pi(s,e)]] = 1;
}
f(0,n-1);
printf("%d",res);
}
