#include<map>

#include<set>

#include<cmath>

#include<queue>

#include<stack>

#include<vector>

#include<cstdio>

#include<cassert>

#include<iomanip>

#include<cstdlib>

#include<cstring>

#include<iostream>

#include<algorithm>

#define pi acos(-1.0)

#define ll long long

#define mod 1000000007

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

const double g=10.0,eps=1e-;

const int N=+,maxn=+,inf=0x3f3f3f;

struct point{

    double x,y;

};

point p[N],s[N][N];

int n,top[N];

bool vis[N];

inline bool zero(double x)

{

    return fabs(x)<eps;

}

double dis(point p1,point p2)

{

    return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y));

}

double dir(point p1,point p2,point p3)

{

    return (p3.x-p1.x)*(p2.y-p1.y)-(p3.y-p1.y)*(p2.x-p1.x);

}

bool comp(point p1,point p2)

{

    double te=dir(p[],p1,p2);

    if(te<)return ;

    if(zero(te)&&dis(p[],p1)<dis(p[],p2))return ;

    return ;

}

void Graham(int k)

{

    int pos;

    double minx=inf,miny=inf;

    for(int i=;i<n;i++)

    {

        if(p[i].x<minx||(p[i].x==minx&&p[i].y<miny))

        {

            minx=p[i].x;

            miny=p[i].y;

            pos=i;

        }

    }

    swap(p[],p[pos]);

    sort(p+,p+n,comp);

    p[n]=p[];

    s[k][]=p[],s[k][]=p[], s[k][]=p[];

    top[k]=;

    for(int i=;i<=n;i++)

    {

        while(top[k]>=&&dir(s[k][top[k]-],s[k][top[k]],p[i])>=)top[k]--;

        s[k][++top[k]]=p[i];

    }

}

double square(int k)

{

    double ans=;

    for(int i=;i<top[k]-;i++)

        ans-=dir(s[k][],s[k][i],s[k][i+]);

    return ans/;

}

bool inside(double sq,double x,double y,int k)

{

     double ans=;

     point p0;p0.x=x,p0.y=y;

     for(int i=;i<top[k];i++)

     {

         if(dir(p0,s[k][i],s[k][i+])<)ans-=dir(p0,s[k][i],s[k][i+]);

         else ans+=dir(p0,s[k][i],s[k][i+]);

     }

     return sq*==ans;

}

int main()

{

    ios::sync_with_stdio(false);

    cin.tie();

    int cnt=;

    while(cin>>n,n!=-){

        for(int i=;i<n;i++)

            cin>>p[i].x>>p[i].y;

        Graham(cnt);

        cnt++;

    }

  /*  for(int i=0;i<cnt;i++)

    {

        for(int j=0;j<top[i];j++)

            cout<<s[i][j].x<<" "<<s[i][j].y<<endl;

    }*/

    memset(vis,,sizeof vis);

    int x,y;

    double ans=;

    while(cin>>x>>y){

        for(int i=;i<cnt;i++)

        {

            double sq=square(i);

            if(!vis[i]&&inside(sq,x,y,i))

            {

                vis[i]=;

                ans+=sq;

                break;

            }

        }

    }

    cout<<setiosflags(ios::fixed)<<setprecision()<<ans<<endl;

    return ;

}

/*********************

*********************/