hdu3867

/*
点光源能够射到的棍子的个数，线段树。
线段树的每个节点记录覆盖这段区间的棍子的下标，以及这根 棍子上的 某点到点光源的距离 
*/
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 10005;
const double eps = 1e-7;
const double pi = acos(-1.0);
int sign(double a){
	return a < -eps ? -1 : (a > eps);
}
struct point{
	double x, y;
	void read(){
		scanf("%lf%lf", &x, &y);
	};
};
struct seg{
	int l, r;
	int id;
	double len;
	int mid(){
		return (l + r) >> 1;
	}
	int getSum(){
		return r - l + 1;
	}
}segs[N*16];
int n;
double ks[N*4];
int  kn;
point ss[N][2], s;
double angs[N][2];
bool mark[N];
double getmid(double r, double l){
	if(r - l > pi) return (r + l) * 0.5 + pi;
	return (r + l) * 0.5;
}
bool input(){
	if(scanf("%d", &n) == EOF) return false;
	point a, b;
	s.read();
	int i;
	for(kn = i = 0; i < n; i++){
		a.read(); ss[i][0] = a;
		b.read(); ss[i][1] = b;
		angs[i][0] = ks[kn++] = atan2(a.y-s.y, a.x-s.x);
		angs[i][1] = ks[kn++] = atan2(b.y-s.y, b.x-s.x);
		if(angs[i][0] > angs[i][1]){
			swap(angs[i][0], angs[i][1]);
			swap(ss[i][0], ss[i][1]);
		}

	}
	return true;
}
int hash(double k){
	return lower_bound(ks, ks+kn, k) - ks;
}
inline int ls(int id){
	return (id<<1)+1;
}
inline int rs(int id){
	return (id<<1)+2;
}
void build(int id, int l, int r){
	segs[id].l = l;
	segs[id].r = r;
	segs[id].id = -1;
	if(l < r){
		int mid = (l + r) >> 1;
		build(ls(id), l, mid);
		build(rs(id), mid+1, r);
	}
}
void change(int id, int k){
	double len;
	point a = ss[k][0], b = ss[k][1];
	double ang = getmid(ks[segs[id].r], ks[segs[id].l]);
	len = (b.y-a.y)*(s.x-a.x) - (b.x-a.x)*(s.y-a.y);
	len /= (sin(ang)*(b.x-a.x) - cos(ang)*(b.y-a.y));
	if(segs[id].id < 0 || sign(len - segs[id].len) < 0){
		segs[id].id = k;
		segs[id].len = len;
	}
}
void down(int id){
	if(segs[id].id >= 0){
		change(ls(id), segs[id].id);
		change(rs(id), segs[id].id);
	}
}
void ins(int id, int l, int r, int k){
	if(l <= segs[id].l && segs[id].r <= r){
		change(id, k);
		return;
	}
	if(segs[id].l == segs[id].r) return ;
	down(id);
	int mid = segs[id].mid();
	if(l <= mid) ins(ls(id), l, r, k);
	if(r > mid) ins(rs(id), l, r, k);
}
void qry(int id){
	if(segs[id].l == segs[id].r){
		if(segs[id].id >= 0){
			mark[segs[id].id] = true;
		}
		return;
	}
	down(id);
	qry(ls(id));
	qry(rs(id));
}
void solve(){
	sort(ks, ks+kn);
	kn = unique(ks, ks+kn) - ks;
	int i, ans, l, r, j;
	j = kn;
	for(i = 1; i < j; i++){
		ks[kn++] = getmid(ks[i], ks[i-1]);
	}
	ks[kn++] = getmid(ks[j-1], ks[0]);
	sort(ks, ks+kn);
	kn = unique(ks, ks+kn) - ks;
	build(0, 0, kn - 1);
	for(i = 0; i < n; i++){
		l = hash(angs[i][0]);
		r = hash(angs[i][1]);
		mark[i] = false;
		if(angs[i][1] - angs[i][0] > pi){
			ins(0, 0, l, i);
			ins(0, r, kn-1, i);
		}else{
			ins(0, l, r, i);
		}
	}
	qry(0);
	for(ans = i = 0; i < n; i++){
		if(mark[i]) ans++;
	}
	printf("%d\n", ans);
}
int main(){
	//freopen("in.txt", "r", stdin);
	while(input()) solve();
	return 0;
}