#include<cstdio>

#include<queue>

#include<cctype>

#include<cstring>

#include<vector>

#include<cmath>

#include<algorithm>

using namespace std;

typedef double dl;

const int INF=;

const int N=;

struct point{//既是向量又是点

    dl x;

    dl y;

}p[*N],ed;

int n;

inline point getmag(point a,point b){

    point s;

    s.x=b.x-a.x;s.y=b.y-a.y;

    return s;

}

inline dl multiX(point a,point b){

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

}

inline int intersect(point a,point b){

    int ans=;

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

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

    dl d1=multiX(getmag(a,p[i]),getmag(a,b))*multiX(getmag(a,p[i+n]),getmag(a,b));

    dl d2=multiX(getmag(p[i],a),getmag(p[i],p[i+n]))*multiX(getmag(p[i],b),getmag(p[i],p[i+n]));

    if(d1<=&&d2<=)ans++;

    }

    return ans;

}

int main(){

    scanf("%d",&n);

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

    scanf("%lf%lf%lf%lf",&p[i].x,&p[i].y,&p[i+n].x,&p[i+n].y);

    }

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

    if(n==){

    printf("Number of doors = 1\n");

    return ;

    }

    int ans=INF;

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

    ans=min(ans,intersect(p[i],ed));

    }

    printf("Number of doors = %d\n",ans);

    return ;

}