import java.util.Scanner; public class HelloWorld { public static void main (String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[][] positions = new int[n][2]; for (int i = 0; i < n; i ++) { positions[i][0] = sc.nextInt(); positions[i][1] = sc.nextInt(); } int count = 1; for (int i = 0; i < n; i ++) { for (int j = i+1; j < n; j ++) { double k = (positions[i][0] - positions[j][0]) == 0 ? 0 : (positions[i][1] - positions[j][1])/(positions[i][0] - positions[j][0]); double b = positions[i][1] - k * positions[i][0]; int count_temp = 0; for (int ni = 0; ni < n; ni ++) { if (k * positions[ni][0] + b == positions[ni][1]) { count_temp ++; } } if (count_temp > count) { count = count_temp; } } } System.out.println(count); } }