#include <bits/stdc++.h>
using namespace std;

int main() {
  freopen("patrate3.in", "r", stdin);
  freopen("patrate3.out", "w", stdout);
	int n;
	scanf("%d", &n);
	vector<pair<int, int>> p(n);
	auto get = []() {
		int x = 0, y = 0;
		scanf("%d.%d", &x, &y);
		return x * 10000 + y;
	};
	for (int i = 0; i < n; ++i) {
		p[i].first = get();
		p[i].second = get();
	}
	vector<long long> v;
	const long long k = 1e9;
	for (int i = 0; i < n; ++i) {
		for (int j = i + 1; j < n; ++j) {
			int x = p[i].first + p[j].first;
			int y = p[i].second + p[j].second;
			v.push_back(x * k + y);
		}
	}
	sort(v.begin(), v.end());
	long long ans = 0;
	for (int i = 0; i < v.size(); ++i) {
		int j = i;
		while (j < v.size() && v[i] == v[j]) j++;
		ans += (j - i) *1ll* (j - i - 1) / 2;
		j = i;
	}
	printf("%lld\n", ans);
	return 0;
}