use proconio::input;
use std::collections::HashMap;
use std::collections::BTreeSet;
fn main(){
    input!{
        n:usize,
    }
    let mut a=[0;100];
    let mut b=[0;100];
    for i in (0..n){
        input!{
            c:usize,d:usize,
        }
        a[i]=c;b[i]=d;
    }
    let mut ans=0;
    for i in (0..n){
        for j in (0..i){
            let mut c=0;
            for l in (0..n){
                if (a[l]-a[i])*(b[j]-b[i])-(b[l]-b[i])*(a[j]-a[i])==0{
                    c+=1;
                }
            }
            if ans<c{
                ans=c;
            }
        }
    }
    print!("{}",ans);
}