import java.util.Scanner;


public class Main_yukicoder245 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();

        int[][] a = new int[4][n];
        for (int i = 0; i < n; i++) {
        	for (int j = 0; j < 4; j++) {
        		a[j][i] = sc.nextInt();
        	}
        }

        int max = 0;
        for (int i = 0; i < n; i++) {
        	for (int j = i; j < n; j ++) {
            	int tmp = 0;
            	int tmp1 = 0;
            	int tmp2 = 0;
            	int tmp3 = 0;
            	for (int k = 0; k < n; k++) {
            		if (Geom.lineIntersect(a[0][i], a[1][i], a[0][j], a[1][j], a[0][k], a[1][k], a[2][k], a[3][k])) {
            			tmp++;
            		}
            		if (Geom.lineIntersect(a[0][i], a[1][i], a[2][j], a[3][j], a[0][k], a[1][k], a[2][k], a[3][k])) {
            			tmp1++;
            		}
            		if (Geom.lineIntersect(a[2][i], a[3][i], a[0][j], a[1][j], a[0][k], a[1][k], a[2][k], a[3][k])) {
            			tmp2++;
            		}
            		if (Geom.lineIntersect(a[2][i], a[3][i], a[2][j], a[3][j], a[0][k], a[1][k], a[2][k], a[3][k])) {
            			tmp3++;
            		}
            	}
            	
            	max = Math.max(max, tmp);
            	max = Math.max(max, tmp1);
            	max = Math.max(max, tmp2);
            	max = Math.max(max, tmp3);
        	}
        }
        
        System.out.println(max);

        sc.close();
    }

	@SuppressWarnings("unused")
	private static class Geom {
		static int dot(int xa, int ya, int xb, int yb) {
			return xa * xb + ya * yb;
		}

		static int cross(int xa, int ya, int xb, int yb) {
			return xa * yb - xb * ya;
		}
		
		static int sumofsquare(int xa, int ya) {
			return xa * xa + ya * ya;
		}

		static boolean lineIntersect(int xa, int ya, int xb, int yb, int xc, int yc, int xd, int yd) {
			/*
			 * 直線ABと線分CDとの交差判定。端点含む
			 * 
			 * |AB|==0 && |CD|==0
			 *     点A==点C
			 * |AB|==0 && |CD|!=0
			 *     ACxAD==0 && AC.AD<0
			 * |AB|!=0
			 *     ABxAC*ABxAD<=0
			 */
			int xab = xb - xa;
			int yab = yb - ya;
			if (xab != 0 || yab != 0) {
				int xac = xc - xa;
				int yac = yc - ya;
				int xad = xd - xa;
				int yad = yd - ya;
				return (long)cross(xab, yab, xac, yac) * cross(xab, yab, xad, yad) <= 0;
			} else {
				int xcd = xd - xc;
				int ycd = yd - yc;
				if (xcd != 0 || ycd != 0) {
					int xac = xc - xa;
					int yac = yc - ya;
					int xad = xd - xa;
					int yad = yd - ya;
					return cross(xac, yac, xad, yad) == 0 && dot(xac, yac, xad, yad) < 0;
				} else {
					return xa == xc && ya == yc;
				}
			}
		}
	}
}