#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
map <pair<int,int>, int> A;
int gcd(int a,int b){
    int c;
    if(a==0 or b==0) return a+b;
    if(a<0) a = a*(-1);
    if(b<0) b = b*(-1);
    while(a*b>0){
        c = b;
        b = a%b;
        a = c;
    }
    return a+b;
}
int main() {
    int x, y, n, i, a, b, m=0, d;
    cin >> x >> y >> n;
    for(i=0;i<n;i++){
        cin >> a >> b;
        a = a-x;
        b = b-y;
        d = gcd(a,b);
        a = a/d;
        b = b/d;
        A[{a,b}]++;
        if(m<A[{a,b}])m=A[{a,b}];
    }
    cout << m;
    return 0;
}