#include<bits/stdc++.h>

#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define EPS (1e-8)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define COUNTER_CLOCKWISE 1
#define CLOCKWISE -1
#define ONLINE_BACK 2
#define ONLINE_FRONT -2
#define ON_SEGMENT 0

using namespace std;

typedef long long ll;

class Point {
public:
  double x,y;
  Point(double x=0,double y=0):x(x),y(y){}

  Point operator + (Point p) { return Point(x+p.x,y+p.y); }
  Point operator - (Point p) { return Point(x-p.x,y-p.y); }
  Point operator * (double a) { return Point(a*x,a*y); }
  Point operator / (double a) { return Point(x/a,y/a); }

  bool operator < ( const Point &p ) const {
    return !equals(x,p.x) ? x < p.x : (!equals(y,p.y)&&y<p.y); 
  }

  bool operator == ( const Point &p ) const {
    return fabs(x-p.x) < EPS && fabs(y-p.y) <EPS;
  }
};

struct Segment {
  Point p1,p2;
  Segment(Point p1=Point(),Point p2=Point()):p1(p1),p2(p2) {}
};
typedef Point Vector;
typedef Segment Line;
typedef vector<Point> Polygon;

double dot(Point a,Point b) { return a.x*b.x + a.y*b.y; }
double cross(Point a,Point b) { return a.x*b.y - a.y*b.x; }
double norm(Point a) { return a.x*a.x + a.y*a.y; }
double abs(Point p) { return sqrt(norm(p)); }

int ccw(Point p0,Point p1,Point p2) {
  Point a = p1 - p0;
  Point b = p2 - p0;
  if( cross(a,b) > EPS ) return COUNTER_CLOCKWISE;
  if( cross(a,b) < -EPS ) return CLOCKWISE;
  if( dot(a,b) < -EPS ) return ONLINE_BACK;
  if( norm(a) < norm(b) ) return ONLINE_FRONT;
  return ON_SEGMENT;
}

bool intersectSS(Line s, Line t) {
  return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&
         ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;
}

Point crosspoint(Line l,Line m) {
  double A = cross(l.p2-l.p1,m.p2-m.p1);
  double B = cross(l.p2-l.p1,l.p2-m.p1);
  if(abs(A) < EPS && abs(B) < EPS){
    vector<Point> vec;
    vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);
    sort(vec.begin(),vec.end());
    assert(vec[1] == vec[2]); //???????????°??????????????????
    return vec[1];
    //return m.p1;
  }
  if(abs(A) < EPS)assert(false);
  return m.p1 + (m.p2-m.p1)*(B/A);
}

double getArea(vector<Point>& vec) {
  double sum = 0;
  for(int i=0;i<(int)vec.size();i++)
    sum += cross(vec[i],vec[(i+1)%vec.size()]);
  return fabs(sum)/2.0;
}

double cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }
  
bool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }
  
bool ccwtest(Point p,Point q,Point r){
  return cross3p(p,q,r) > 0;
}
 
bool onSegment(Point p,Point q,Point r){
  return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;
}

double angle(Point a,Point b,Point c) {
  double ux = b.x - a.x, uy = b.y - a.y;
  double vx = c.x - a.x, vy = c.y - a.y;
  return acos((ux*vx + uy*vy)/sqrt((ux*ux + uy*uy) * (vx*vx + vy*vy)));
}  
  
bool inPolygon(Polygon poly,Point p){
  if((int)poly.size() == 0)return false;
  rep(i,(int)poly.size()) if(onSegment(poly[i],poly[(i+1)%poly.size()],p))return true;
  double sum = 0;
  for(int i=0; i < (int)poly.size() ;i++) {
    if( equals(cross(poly[i]-p,poly[(i+1)%poly.size()]-p),0.0) ) continue; 
    if( cross3p(p,poly[i],poly[(i+1)%poly.size()]) < 0 ) sum -= angle(p,poly[i],poly[(i+1)%poly.size()]);
    else                                                 sum += angle(p,poly[i],poly[(i+1)%poly.size()]);
  }
  const double eps = 1e-5;
  return (fabs(sum - 2*M_PI) < eps || fabs(sum + 2*M_PI) < eps);
}  


#define MAX_N 110

int N, x[MAX_N], y[MAX_N], a[5], b[5];

void compute() {
  vector<int> xs,ys;
  rep(i,4) {
    xs.push_back(a[i]);
    ys.push_back(b[i]);
  }
  rep(i,N) {
    xs.push_back(x[i]);
    ys.push_back(y[i]);
    Segment s1 = Segment(Point(x[i],y[i]),Point(x[(i+1)%N],y[(i+1)%N]));
    rep(j,4) {
      Segment s2 = Segment(Point(a[j],b[j]),Point(a[(j+1)%4],b[(j+1)%4]));
      if( equals(cross(s1.p2-s1.p1,s2.p2-s2.p1),0.0) )  continue;
      if( intersectSS(s1,s2) ) {
	Point cp = crosspoint(s1,s2);
	xs.push_back(cp.x);
	ys.push_back(cp.y);
      }
    }
  }
  
  xs.push_back(0);
  //xs.push_back(200000);
  ys.push_back(0);
  //ys.push_back(200000);
  sort(xs.begin(),xs.end());
  xs.erase(unique(xs.begin(),xs.end()),xs.end());
  sort(ys.begin(),ys.end());
  ys.erase(unique(ys.begin(),ys.end()),ys.end());

  Polygon window;
  rep(i,N) window.push_back(Point(x[i],y[i]));
  double danswer = getArea(window);

  ll answer = (ll)danswer;
  //cout <<"area = " << answer << endl;
  
  Polygon poly;
  rep(i,4) poly.push_back(Point(a[i],b[i]));
  /*
  cout << "xs---" << endl;
  rep(i,(int)xs.size()){
    cout << xs[i] << endl;
  }

  cout << "ys---" << endl;
  rep(i,(int)ys.size()){
    cout << ys[i] << endl;
  }
  */

  rep(i,(int)xs.size()-1) {
    rep(j,(int)ys.size()-1) {
      //cout << "(" << xs[i] << "," << ys[j] << ") and (" << xs[i+1] << "," << ys[j+1] << ")" << endl;
      Point mid = Point( ( xs[i] + xs[i+1] ) / 2.0, ( ys[j] + ys[j+1] ) / 2.0 );
      //cout << "mid = (" << mid.x << "," << mid.y << ")" <<endl;
      if( inPolygon(poly,mid) && inPolygon(window,mid) ) {
	answer -= ( xs[i+1] - xs[i] ) * ( ys[j+1] - ys[j] );
	//cout << "erase " << ( xs[i+1] - xs[i] ) * ( ys[j+1] - ys[j] ) << endl;

      }
    }
  }
  cout<< answer << endl;
  
}

int main() {
  while( cin >> N, N ) {
    rep(i,N) cin >> x[i] >> y[i];
    rep(i,4) cin >> a[i] >> b[i];
    compute();
  }
  return 0;
}

Measured memory_bytes: 3492