#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;

int n, x[20], y[20];
bool parallel(int i, int j, int k, int l){
	ll dx1 = x[i] - x[j];
	ll dy1 = y[i] - y[j];
	ll dx2 = x[k] - x[l];
	ll dy2 = y[k] - y[l];
	return dx1 * dy2 == dx2 * dy1;
}
int num[1 << 16];

int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	
	cin >> n;
	rep(i, n) cin >> x[i] >> y[i];
	rep(mask, 1 << n){
		rep(i, n) rep(j, i) if((mask >> i & 1) && (mask >> j & 1)){
			int cnt = 0;
			rep(k, n) rep(l, k) if((mask >> k & 1) && (mask >> l & 1) && parallel(i, j, k, l)) cnt++;
			num[mask] = max(num[mask], cnt * (cnt - 1) / 2);
		}
	}
	
	rep(i, 1 << n) for(int j = i; j; j = j - 1 & i) num[i] = max(num[i], num[j] + num[i ^ j]);
	cout << num[(1 << n) - 1] << endl;
	
	return 0;
}