#if __has_include("../library/Basic/Debug.hpp")

#include "../library/Basic/Debug.hpp"

#else

/* ----- Header Files ----- */
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>

// container
#include <vector>
#include <string>
#include <tuple>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>

// others
#include <random>
#include <limits>
#include <functional>
#include <ctime>
#include <cassert>
#include <cstdint>


/* ----- Type Alias ----- */
using Bool = bool;
using Int = long long int;
using Real = long double;
using Char = char;
using String = std::string;
template <class... Ts>
using Tuple = std::tuple<Ts...>;

template <class T>
using Vector = std::vector<T>;
template <class T>
using Matrix = Vector<Vector<T>>;
template <class T>
using Queue = std::queue<T>;
template <class T>
using Stack = std::stack<T>;
template <class T>
using Deque = std::deque<T>;

template <class T>
using MaxHeap = std::priority_queue<T>;
template <class T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T>
using Set = std::set<T>;
template <class T, class U>
using Map = std::map<T, U>;

template <class T, class... Us>
using Func = std::function<T(Us...)>;

template <class T>
T genv(T v) { return v; }

template <class T, class... Ts>
auto genv(size_t l, Ts... ts) {
    return Vector<decltype(genv<T>(ts...))>(l, genv<T>(ts...));
}

template <class Cost = Int>
struct Edge {
    Int src, dst;
    Cost cost;
    Edge(Int src = -1, Int dst = -1, Cost cost = 1)
        : src(src), dst(dst), cost(cost){};

    bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }
    bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }
};

template <class Cost = Int>
using Edges = Vector<Edge<Cost>>;
template <class Cost = Int>
using Graph = Vector<Vector<Edge<Cost>>>;

#endif

/* ----- Misc ----- */
void fastio() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
}

struct Fout {
    Int precision;
    Fout(Int precision) : precision(precision) {}
};
std::ostream& operator<<(std::ostream& os, const Fout& fio) {
    os << std::fixed << std::setprecision(fio.precision);
    return os;
}


/* ----- Constants ----- */
// constexpr Int INF = std::numeric_limits<Int>::max() / 3;
// constexpr Int MOD = 1000000007;
// constexpr Real PI = acos(-1);
// constexpr Real EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));

int main() {
    Int n;
    std::cin >> n;

    Vector<Int> x(n), y(n);
    for (Int i = 0; i < n; ++i) {
        std::cin >> x[i] >> y[i];
    }

    Func<Int, Int, Vector<Int>&> dfs =
        [&](Int b, Vector<Int>& ps) {
            Int ret = 0;

            if (__builtin_popcountll(b) == n) {
                Vector<Int> dx(n / 2), dy(n / 2);
                for (Int i = 0; i < n / 2; ++i) {
                    dx[i] = x[ps[i * 2]] - x[ps[i * 2 + 1]];
                    dy[i] = y[ps[i * 2]] - y[ps[i * 2 + 1]];
                }

                for (Int i = 0; i < n / 2; ++i) {
                    for (Int j = 0; j < i; ++j) {
                        if (dx[i] * dy[j] == dy[i] * dx[j]) ++ret;
                    }
                }
            } else {
                Int i;
                for (i = 0; (b >> i) & 1; ++i) {}
                for (Int j = i + 1; j < n; ++j) {
                    if ((b >> j) & 1) continue;
                    ps.push_back(i);
                    ps.push_back(j);

                    ret = std::max(ret, dfs(b + (1 << i) + (1 << j), ps));

                    ps.pop_back();
                    ps.pop_back();
                }
            }
            return ret;
        };

    Vector<Int> p;
    std::cout << dfs(0, p) << std::endl;
    return 0;
}



Measured memory_bytes: 3152