import java.util.*;

public class Main {
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arrX = new int[n];
		int[] arrY = new int[n];
		for (int i = 0; i < n; i++) {
		    arrX[i] = sc.nextInt();
		    arrY[i] = sc.nextInt();
		}
		int max = 2;
		for (int i = 0; i < n - 2; i++) {
		    for (int j = i + 1; j < n - 1; j++) {
		        int x = arrX[i] - arrX[j];
		        int y = arrY[i] - arrY[j];
		        int count = 0;
		        for (int k = j + 1; k < n; k++) {
    		        int xx = arrX[i] - arrX[k];
    		        int yy = arrY[i] - arrY[k];
    		        if (x * yy == y * xx) {
    		            count++;
    		        }
		        }
		        max = Math.max(max, count + 2);
		    }
		}
		System.out.println(max);
	}
}