#include<map>

#include<queue>

#include<vector>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

bool ck(int x,int y){return x>=&&x<=&&y>=&&y<=;}

struct P

{

    int x,y;

    P(){}

    P(int x,int y):x(x),y(y){}

};

bool cmp(P a,P b)

{

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

    return a.x<b.x;

}

struct sp

{

    P s[];

    int v()

    {

        int hs = ;

        for(int i=;i<=;i++)hs=hs*+(s[i].x-)*+s[i].y-;

        return hs;

    }

    bool emp(int x,int y)

    {

        if(!ck(x,y))return ;

        for(int i=;i<=;i++)if(s[i].x==x&&s[i].y==y)return ;

        return ;

    }

    void bal()

    {

        sort(s+,s+,cmp);

    }

}a,b,u,t;

int dx[]={-,,,},dy[]={,,-,};

int bfs()

{

    map<int,int>mp1,mp2;

    queue<sp>q1,q2,tmp;

    int hs1,hs2,x,y,tx,ty;

    hs1 = a.v(),hs2=b.v();

    if(hs1==hs2)return ;

    mp1[hs1]=mp2[hs2]=;

    q1.push(a),q2.push(b);

    for(register int dep=;dep<=;dep++)

    {

        while(!q1.empty())

        {

            u = q1.front();

            q1.pop();

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

            {

                x = u.s[i].x,y = u.s[i].y;

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

                {

                    t=u;

                    tx=x+dx[j],ty=y+dy[j];

                    if(!t.emp(tx,ty))

                    {

                        tx+=dx[j],ty+=dy[j];

                    }

                    if(t.emp(tx,ty))

                    {

                        t.s[i].x=tx,t.s[i].y=ty;

                        t.bal();

                        hs1 = t.v();

                        if(mp2[hs1])return dep+mp2[hs1];

                        if(!mp1[hs1])

                        {

                            mp1[hs1]=dep;

                            tmp.push(t);

                        }

                    }

                }

            }

        }

        while(!tmp.empty())q1.push(tmp.front()),tmp.pop();

        while(!q2.empty())

        {

            u = q2.front();

            q2.pop();

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

            {

                x = u.s[i].x,y = u.s[i].y;

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

                {

                    t=u;

                    tx=x+dx[j],ty=y+dy[j];

                    if(!t.emp(tx,ty))

                    {

                        tx+=dx[j],ty+=dy[j];

                    }

                    if(t.emp(tx,ty))

                    {

                        t.s[i].x=tx,t.s[i].y=ty;

                        t.bal();

                        hs2 = t.v();

                        if(mp1[hs2])return dep+mp1[hs2];

                        if(!mp2[hs2])

                        {

                            mp2[hs2]=dep;

                            tmp.push(t);

                        }

                    }

                }

            }

        }

        while(!tmp.empty())q2.push(tmp.front()),tmp.pop();

    }

    return ;

}

int main()

{

    while(scanf("%d%d",&a.s[].x,&a.s[].y)>)

    {

        for(int i=;i<=;i++)scanf("%d%d",&a.s[i].x,&a.s[i].y);

        for(int i=;i<=;i++)scanf("%d%d",&b.s[i].x,&b.s[i].y);

        sort(a.s+,a.s+,cmp),sort(b.s+,b.s+,cmp);

        printf(bfs()?"YES\n":"NO\n");

    }

    return ;

}