#include<cstdio>

#include<iostream>

#include<cstring>

#include<algorithm>

#include<queue>

#include<set>

#include<map>

#include<stack>

#include<time.h>

#include<cstdlib>

#include<cmath>

#include<list>

using namespace std;

#define MAXN 100100

#define eps 1e-9

#define For(i,a,b) for(int i=a;i<=b;i++)

#define Fore(i,a,b) for(int i=a;i>=b;i--)

#define lson l,mid,rt<<1

#define rson mid+1,r,rt<<1|1

#define mkp make_pair

#define pb push_back

#define cr clear()

#define sz size()

#define met(a,b) memset(a,b,sizeof(a))

#define iossy ios::sync_with_stdio(false)

#define fre freopen

#define pi acos(-1.0)

#define inf 1e6+7

#define Vector Point

const int Mod=1e9+;

typedef unsigned long long ull;

typedef long long ll;

int dcmp(double x){

    if(fabs(x)<=eps) return ;

    return x<?-:;

}

struct Point{

    double x,y;

    Point(double x=,double y=):x(x),y(y) {}

    bool operator < (const Point &a)const{

        if(x==a.x) return y<a.y;

        return x<a.x;

    }

    Point operator - (const Point &a)const{

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

    }

    Point operator + (const Point &a)const{

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

    }

    Point operator * (const double &a)const{

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

    }

    Point operator / (const double &a)const{

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

    }

    void read(){

        scanf("%lf%lf",&x,&y);

    }

    void out(){

        cout<<"debug: "<<x<<" "<<y<<endl;

    }

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

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

    }

};

double Dot(Vector a,Vector b) {

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

}

double dis(Vector a) {

    return sqrt(Dot(a,a));

}

double Cross(Point a,Point b){

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

}

int ConvexHull(Point *p,int n,Point *ch){

    int m=;

    For(i,,n-) {

        while(m> && Cross(ch[m-]-ch[m-],p[i]-ch[m-])<=) m--;

        ch[m++]=p[i];

    }

    int k=m;

    Fore(i,n-,){

        while(m>k && Cross(ch[m-]-ch[m-],p[i]-ch[m-])<=) m--;

        ch[m++]=p[i];

    }

    if(n>) m--;

    return m;

}

int n1,n2,m;

Point p1[],p2[];

Point ch[];

bool check(Point tp){

    if(Cross(tp-ch[],ch[]-ch[])>= || Cross(tp-ch[],ch[m-]-ch[])<=) return ;

    int l=,r=m-;

    int now=l;

    while(l<=r) {

        int mid=l+r>>;

        if(Cross(ch[mid]-ch[],tp-ch[])>) l=mid+,now=mid;

        else r=mid-;

    }

    return Cross(ch[(now+)%m]-ch[now],tp-ch[now])>;

}

void solve(){

    cin>>n1;

    For(i,,n1-) p1[i].read();

    cin>>n2;

    For(i,,n2-) p2[i].read();

    sort(p1,p1+n1);

    m=ConvexHull(p1,n1,ch);

    int mk=;

    For(i,,n2-) {

        if(!mk) break;

        if(!check(p2[i])) mk=;

    }

    if(mk) cout<<"YES"<<endl;

    else cout<<"NO"<<endl;

}

int main(){

//    fre("in.txt","r",stdin);

    int t=;

    solve();

    return ;

}