#include int main() { int n; scanf("%d", &n); int i, j, k; int x[102], y[102]; for (i = 0; i < n; i++) scanf("%d %d", &x[i], &y[i]); int ans = 0, cnt; for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { cnt = 0; if (x[i] == x[j]) { for (k = 0; k < n; k++) if (x[k] == x[i]) cnt++; } else { for (k = 0; k < n; k++) if ((y[j] - y[i]) * (x[k] - x[i]) == (y[k] - y[i]) * (x[j] - x[i])) cnt++; } if (ans < cnt) ans = cnt; } } printf("%d\n", ans); return 0; }