import java.util.*;
import java.awt.Point;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        Point[] p = new Point[N];
        for (Point e: p) {
            e = new Point(sc.nextInt(), sc.nextInt());
        }

        int ans = 0;
        for (int i = 0; i < N; i++) {
            for (int j = i+1; j < N; j++) {
                int cnt = 2;
                for (int k = j + 1; k < N; k++) {
                    if (isCollinear(p[i], p[j], p[k])) {
                        cnt++;
                    }
                }
                ans = Math.max(ans, cnt);
            }
        }
        System.out.println(ans);
    }

    static boolean isCollinear(Point a, Point b, Point c) {
        // if (a.x == b.x && a.y == b.y) return false;
        if (a.x == b.x) return a.x == c.x;
        if (a.y == b.y) return a.y == c.y;
        return a.x*b.y-b.x*a.y + b.x*c.y-c.x*b.y + c.x*a.y-a.x*c.y == 0;
    }

}