package coord_count;

import java.util.Scanner;

class Point {
	private int x;
	private int y;

	public Point(int x, int y) {
		this.x = x;
		this.y = y;
	}

	public int getX() {
		return this.x;
	}

	public int getY() {
		return this.y;
	}
}

public class CoordCount {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);


		int N = sc.nextInt();
		Point[] points = new Point[N];

		for(int i = 0; i <N; i++) {
			int x = sc.nextInt();
			int y = sc.nextInt();
			points[i] = new Point(x, y);
		}

		System.out.println(maxCnt(points));
	}

	private static int maxCnt(Point[] points) {
		int maxCnt = 0;

		for(int i = 0; i < points.length - 1; i++) {
			for(int j = (i + 1); j < points.length; j++) {
				int cnt = 2;
				int dx = points[i].getX() - points[j].getX();
				int dy = points[i].getY() - points[j].getY();
				for(int k = (j + 1); k < points.length; k++) {
					int nx = points[i].getX() - points[k].getX();
					int ny = points[i].getY() - points[k].getY();
					if(dx * ny == dy * nx) {
						cnt++;
					}
				}
				if(maxCnt < cnt) {
					maxCnt = cnt;
				}
			}

		}

		return maxCnt;
	}

}