import kotlin.math.abs
import kotlin.math.max

fun gcd(a:Int, b:Int): Int{
    return if(b==0) a else gcd(b, a%b)
}

fun main(){
    val n = readLine()!!.toInt()
    val points = Array(n){readLine()!!.split(" ").map{it.toInt()}}
    val f: (Int, Int) -> Pair<Int,Int> = { i, j ->
        var dx = points[j][0]-points[i][0]
        var dy = points[j][1]-points[i][1]
        with(gcd(abs(dx), abs(dy))){
            dx /= this
            dy /= this
        }
        Pair(dx, dy)
    }
    var answer = 0
    for(i in 0 until n){
        for(j in i+1 until n){
            var tmp = 2
            val (dx, dy) = f(i, j)
            for(k in 0 until n){
                if(k == i || k == j)    continue
                val (ddx, ddy) = f(i, k)
                if(ddx==dx && ddy==dy || -ddx==-dx && -ddy==-dy)    tmp++
            }
            answer = max(answer, tmp)
        }
    }
    println(answer)
}