Farmer John has challenged Bessie to the following game: FJ has a board with dots marked at N (2 ≤ N ≤ 200) distinct lattice points. Dot i has the integer coordinates X_i and Y_i (-1,000 ≤ X_i ≤ 1,000; -1,000 ≤ Y_i ≤ 1,000).

Bessie can score a point in the game by picking two of the dots and drawing a straight line between them; however, she is not allowed to draw a line if she has already drawn another line that is parallel to that line. Bessie would like to know her chances of winning, so she has asked you to help find the maximum score she can obtain.

* Line 1: A single integer: N

* Line 1: A single integer representing the maximal number of lines Bessie can draw, no two of which are parallel.

#include
    
     #include
     
      #include
      
       #include
       
        using namespace std;struct self{int x,y;}s[40044];int m,a,b,c,z;set
        
         q;bool zero=0;bool ok(int x1,int y1,int x2,int y2){    int x=x1-x2;    int y=y1-y2;    if(x==0)    {        if(!zero)        {            zero=1;            return true;        }        return false;    }    if(q.insert(double(y)/x).second)return true;    return false;}int main(){    scanf("%d",&m);    for(a=1;a<=m;a++)scanf("%d%d",&s[a].x,&s[a].y);        for(a=1;a<=m;a++)        for(b=a+1;b<=m;b++)        if(ok(s[a].x,s[a].y,s[b].x,s[b].y))z++;        cout<
         
          <<'\n'; return 0;}