ans=

ans=

 //      ——By DD_BOND

 //#include<bits/stdc++.h>

 //#include<unordered_map>

 //#include<unordered_set>

 #include<functional>

 #include<algorithm>

 #include<iostream>

 //#include<ext/rope>

 #include<iomanip>

 #include<climits>

 #include<cstring>

 #include<cstdlib>

 #include<cstddef>

 #include<cstdio>

 #include<memory>

 #include<vector>

 #include<cctype>

 #include<string>

 #include<cmath>

 #include<queue>

 #include<deque>

 #include<ctime>

 #include<stack>

 #include<map>

 #include<set>

 #define fi first

 #define se second

 #define pb push_back

 #define MP make_pair

 using namespace std;

 typedef double db;

 typedef long ll;

 typedef pair<db,db> Pd;

 typedef pair<int,int> P;

 typedef pair<ll,ll> Pll;

 const db eps=1e-;

 const int MAXN=1e3+;

 const db pi=acos(-1.0);

 const ll INF=0x3f3f3f3f3f3f3f3f;

 inline int dcmp(db x){

     if(fabs(x)<eps) return ;

     return (x>? : -);

 }

 inline db Sqrt(db x){

     return x>? sqrt(x): ;

 }

 inline db sqr(db x){ return x*x; }

 struct Point{

     db x,y;

     Point(){ x=,y=; }

     Point(db _x,db _y):x(_x),y(_y){}

     void input(){

         double _x,_y;

         scanf("%lf%lf",&_x,&_y);

         x=_x,y=_y;

     }

     bool operator ==(const Point &b)const{

         return (dcmp(x-b.x)==&&dcmp(y-b.y)==);

     }

     bool operator <(const Point &b)const{

         return (dcmp(x-b.x)==? dcmp(y-b.y)< : x<b.x);

     }

     Point operator +(const Point &b)const{

         return Point(x+b.x,y+b.y);

     }

     Point operator -(const Point &b)const{

         return Point(x-b.x,y-b.y);

     }

     Point operator *(db a){

         return Point(x*a,y*a);

     }

     Point operator /(db a){

         return Point(x/a,y/a);

     }

     db len2(){  //长度平方

         return sqr(x)+sqr(y);

     }

     db len(){   //长度

         return Sqrt(len2());

     }

     db polar(){ //向量的极角

         return atan2(y,x);   //返回与x轴正向夹角(-pi~pi]

     }

     Point change_len(db r){ //转化为长度为r的向量

         db l=len();

         if(dcmp(l)==)  return *this;  //零向量

         return Point(x*r/l,y*r/l);

     }

     Point rotate(Point p,db ang){   //绕点p逆时针旋转ang度

         Point v=(*this)-p;

         db c=cos(ang),s=sin(ang);

         return Point(p.x+v.x*c-v.y*s,p.y+v.x*s+v.y*c);

     }

 };

 inline db cross(Point a,Point b){   //叉积

     return a.x*b.y-a.y*b.x;

 }

 inline db dot(Point a,Point b){ //点积

     return a.x*b.x+a.y*b.y;

 }

 inline db dis(Point a,Point b){ //两点的距离

     Point p=b-a;    return p.len();

 }

 db rad(Point a,Point b){    //两个向量的夹角

     return fabs(atan2(fabs(cross(a,b)),dot(a,b)));

 }

 struct Node{

     Point vec,s,t;

     Node(){}

     Node(Point a,Point b,Point c){

         vec=a,s=b,t=c;

     }

 };

 Point a[],b[],tmp[];

 int main(void){

     int n;

     while(~scanf("%d",&n)){

         int ans=;

         for(int i=;i<n;i++)    a[i].input(),a[i+n]=a[i];

         int m;  scanf("%d",&m);

         for(int i=;i<m;i++)    b[i].input(),b[i+m]=b[i];

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

             for(int j=;j<m;j++)

                 if(dcmp(dis(a[i],a[i+])-dis(b[j],b[j+]))==){

                     int p=,f=;

                     vector<Node>st;

                     db ang=rad(b[j+]-b[j],a[i+]-a[i]);

                     if(dcmp(cross(b[j+]-b[j],a[i+]-a[i]))>=)  ang-=pi;

                     else    ang=pi-ang;

                     for(int k=;k<i;k++)        tmp[p++]=a[k];

                     for(int k=j+;k<j+m+;k++)  tmp[p++]=a[i+]+(b[k]-b[j]).rotate(Point(,),ang);

                     for(int k=i+;k<n;k++)      tmp[p++]=a[k];

                     tmp[p]=tmp[];

                     for(int i=;i<p;i++){

                         Point res=tmp[i+]-tmp[i];

                         if(st.size()&&st.back().t==tmp[i]&&st.back().s==tmp[i+])   st.pop_back();

                         else    st.pb(Node(res,tmp[i],tmp[i+]));

                     }

                     st.pb(st[]);

                     for(int i=;i<(int)st.size();i++)

                         if(dcmp(cross(st[i-].vec,st[i].vec))<||

                           (dcmp(cross(st[i-].vec,st[i].vec))==&&dcmp(dot(st[i-].vec,st[i].vec))<=))

                             f=;

                     if(!f)  ans=;

                 }

         printf("%d\n",ans);

     }

     return ;

 }