import java.util.*;
public class Main {

  public static void main(String[] args) { 
      Scanner sc = new Scanner(System.in);
      int n = sc.nextInt();
      int[][] points = new int[n][2];
      for(int i = 0; i < n; i++) {
        points[i][0] = sc.nextInt();
        points[i][1] = sc.nextInt();
      }
      int max = 0;
      for(int i = 0; i < n; i++) {
        for(int j = i + 1; j < n; j++) {
          int cnt = 2;
          int dx = points[i][0] - points[j][0];
          int dy = points[i][1] - points[j][1];
          for(int k = 0; k < n; k++) {
              if(k == i || k == j) continue;
              int dxk = points[i][0] - points[k][0];
              int dyk = points[i][1] - points[k][1];
              if(dx * dyk == dy * dxk) cnt++;
          }
          max = Math.max(max, cnt);
        }
      }
      System.out.println(max);
  }
}