//

//  main.cpp

//  poj1066

//

//  Created by 陈加寿 on 15/12/30.

//  Copyright (c) 2015年 chenhuan001. All rights reserved.

//

#include <iostream>

#include <stdio.h>

#include <string.h>

#include <math.h>

#include <algorithm>

using namespace std;

struct line

{

    int x1,y1;

    int x2,y2;

}g[];

int save[];

int chg(int x,int y)

{

    if( y== ) return x;

    if( x== ) return +-y;

    if( y== ) return  +  -x;

    return +y;

}

int main(int argc, const char * argv[]) {

    int n;

    while( scanf("%d",&n)!=EOF )

    {

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

        {

            scanf("%d%d%d%d",&g[i].x1,&g[i].y1,&g[i].x2,&g[i].y2);

            g[i].x1 *= ;

            g[i].y1 *= ;

            g[i].x2 *= ;

            g[i].y2 *= ;

        }

        double x,y;

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

        x*=;

        y*=;

        memset(save,,sizeof(save));

        //以防万一，还是坐标乘2先

        int num=;

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

        {

            if( chg( g[i].x1,g[i].y1 ) > chg(g[i].x2,g[i].y2) )

            {

                swap(g[i].x1,g[i].x2);

                swap(g[i].y1,g[i].y2);

            }

            int b,d;

            b= chg( g[i].x1,g[i].y1 );

            d= chg( g[i].x2,g[i].y2 );

            double p1x,p1y,p2x,p2y;

            p1x = g[i].x1-x;

            p1y = g[i].y1-y;

            p2x = g[i].x2-x;

            p2y = g[i].y2-y;

            if( p1x*p2y - p1y*p2x >  )

            {

                num++;

                for(int j=b+;j<=d-;j++) save[j]--;

            }

            else

            {

                for(int j=b;j<=d;j++) save[j]++;

            }

        }

        int mi=;

        for(int i=;i<;i++) mi = min(mi ,save[i] );

        printf("Number of doors = %d\n",mi+num+);

    }

    return ;

}