#include <algorithm>

#include <iostream>

#include <algorithm>

#include <stdio.h>

#include <string.h>

#include <queue>

#include <stdlib.h>

using namespace std;

#define M 12

int main()

{

int a[M],b[M],t=0,m,i=0,n=0,j;

float z=0;

while(!cin.eof())

{

cin>>a[i]>>b[i];

i++;

n++;

}

for(i=0; i<n-1; i++)

{

for(j=i+1; j<=n; j++)

{

m=1;

z=(b[j]-b[i])*(1.0)/(a[j]-a[i]);

m++;

for(int k=i+2; k<=n; k++)

{

if((b[k]-b[i])*(1.0)/(a[k]-a[i])==z)

m++;

}

if(m>t) t=m;

}

}

cout<<t;

return 0;

}