#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;const int INF=0x3f3f3f3f;
typedef long long ll;
typedef unsigned long long ull;
#define prN printf("\n")
#define SI(N) scanf("%d",&(N))
#define SII(N,M) scanf("%d%d",&(N),&(M))
#define SIII(N,M,K) scanf("%d%d%d",&(N),&(M),&(K))
#define cle(a,val) memset(a,(val),sizeof(a))
#define rep(i,b) for(int i=0;i<(b);i++)
#define Rep(i,a,b) for(int i=(a);i<=(b);i++)
#define reRep(i,a,b) for(int i=(a);i>=(b);i--)
const int MAX_N= 1000+5 ;
const double eps= 1e-9 ;int sgn(double x)
{if(fabs(x) < eps)return 0;if(x < 0) return -1;else return 1;
}
struct Point
{double x,y;Point() {}Point(double _x,double _y){x = _x;y = _y;}Point operator -(const Point &b)const{return Point(x - b.x,y - b.y);}double operator ^(const Point &b)const{return x*b.y - y*b.x;}double operator *(const Point &b)const{return x*b.x + y*b.y;}
};
struct Line
{Point s,e;Line() {}Line(Point _s,Point _e){s = _s;e = _e;}};bool inter(Line l1,Line l2)
{//这要多判断一步，是否是边界点，因为遍历就是从边界开始的，所以要除掉2个端点if (fabs(l1.s.x-l2.s.x)<eps&&fabs(l1.s.y-l2.s.y)<eps||fabs(l1.s.x-l2.e.x)<eps&&fabs(l1.s.y-l2.e.y)<eps)return false;returnmax(l1.s.x,l1.e.x) >= min(l2.s.x,l2.e.x) &&max(l2.s.x,l2.e.x) >= min(l1.s.x,l1.e.x) &&max(l1.s.y,l1.e.y) >= min(l2.s.y,l2.e.y) &&max(l2.s.y,l2.e.y) >= min(l1.s.y,l1.e.y) &&sgn((l2.s-l1.s)^(l1.e-l1.s))*sgn((l2.e-l1.s)^(l1.e-l1.s)) <= 0 &&sgn((l1.s-l2.s)^(l2.e-l2.s))*sgn((l1.e-l2.s)^(l2.e-l2.s)) <= 0;
}
double dist(Point a,Point b)
{return sqrt((b-a)*(b-a));
}Line line[35];
Point po[65];
int n,num,res=INF;
double endx,endy;void sol()
{if (n==0){puts("Number of doors = 1");return;}rep(i,num){int ans=0;Line tel(po[i],Point(endx,endy));rep(j,n){if (inter(tel,line[j])){ans++;}}res=min(ans,res);}printf("Number of doors = %d\n",res+1);
}int main()
{double x1,y1,x2,y2;SI(n);rep(i,n){scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);po[num++]=Point(x1,y1);po[num++]=Point(x2,y2);line[i]=Line(Point(x1,y1),Point(x2,y2));}scanf("%lf%lf",&endx,&endy);sol();return 0;
}