#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}

bool paralell(P a, P b, P c, P d){
  auto check=[](P a, P b, P c, P d){
    b = P(b.first - a.first, b.second - a.second);
    d = P(d.first - c.first, d.second - c.second);
    //b.second / b.first == d.second / d.first;
    return b.second * d.first == d.second * b.first;
  };
  return check(a, b, c, d) || check(a, b, d, c);
}

int n;

vector<P> A;

int used[1<<16], mem[1<<16];
int dfs(int bit){
  if(used[bit]++) return mem[bit];
  
  int res = 0;
  for(int i=0;i<n;i++){
    for(int j=i+1;j<n;j++){
      if((bit >> i & 1) || (bit >> j & 1)) continue;
      int cnt = 1;
      int nbit = bit | (1<<i) | (1<<j);
      for(int k=0;k<n;k++)
	for(int l=k+1;l<n;l++){
	  if((nbit>>k&1) || (nbit>>l&1)) continue;
	  if(!paralell(A[i], A[j], A[k], A[l])) continue;
	  nbit |= (1<<k) | (1<<l);
	  cnt++;
	}
      Max(res, dfs(nbit) + cnt * (cnt - 1) / 2);
    }
  }
  return mem[bit] = res;
}

signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);
  cin>>n;
  A.resize(n);
  cin>>A;

  int ans = dfs(0);
  cout<<ans<<endl;  
  return 0;
}

