// yukicoder: No.245 貫け！
// 2019.7.18 bal4u

#include <stdio.h>
#include <stdlib.h>

#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif
int in() {  // 整数の入力（負数対応）
	int n = 0, c = gc();
	if (c == '-') {	c = gc();
		do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
		return -n;
	}
	do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

typedef struct { int x, y; } PP;
typedef struct { PP s, e; } SEG, LINE;

#define EQ(a,b)		((a)==(b))
#define PPeQ(a,b)	(EQ(a.x,b.x)&&EQ(a.y,b.y))

int intersect(PP p1, PP p2, SEG s) {
	int a = (p2.x-p1.x) * (s.s.y-p1.y) + (p2.y-p1.y) * (p1.x-s.s.x);
	int b = (p2.x-p1.x) * (s.e.y-p1.y) + (p2.y-p1.y) * (p1.x-s.e.x);
	return a*b <= 0;
}

SEG s[105]; int N;
int ans;

void check(PP sln, PP eln) {
	int i, t;
	
	if (PPeQ(sln, eln)) return;
	t = 0; for (i = 0; i < N; i++) if (intersect(sln, eln, s[i])) t++;
	if (t > ans) {
		ans = t;
		if (ans == N) { printf("%d\n", N); exit(0); }
	}
}

int main()
{
	int i, j;
	
	N = in();
	if (N <= 2) { printf("%d\n", N); return 0; }
	for (i = 0; i < N; i++) {
		s[i].s.x = in(), s[i].s.y = in(), s[i].e.x = in(), s[i].e.y = in();
	}
	for (i = 0; i < N; i++) for (j = i+1; j < N; j++) {
		check(s[i].s, s[j].s), check(s[i].s, s[j].e);
		check(s[i].e, s[j].s), check(s[i].e, s[j].e);
	}
	printf("%d\n", ans);
	return 0;
}