#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> using mint = modint998244353; template void debug(T e) { cerr << e << endl; } template void debug(vector &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(map &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } ll my_gcd(ll a, ll b) { ll ret = 0; if (a < b) { swap(a, b); } if (b == 0) { ret = a; } else { ret = my_gcd(b, a % b); } return ret; } int main() { ll N; cin >> N; vector x(N); vector y(N); for (ll i = 0; i < N; i++) { cin >> x[i] >> y[i]; } // 傾きと中央の点の座標の組を持つ map, ll> mp; for (ll i = 0; i < N; i++) { for (ll j = i + 1; j < N; j++) { ll fx = x[j] - x[i]; ll fy = y[j] - y[i]; ll cx = x[i] + x[j]; ll cy = y[i] + y[j]; if (fx == 0) { pll p = pll(0, 1); pll c = pll(cx, cy); mp[pair(p, c)]++; } else if (fy == 0) { pll p = pll(1, 0); pll c = pll(cx, cy); mp[pair(p, c)]++; } else { ll g = my_gcd(abs(fx), abs(fy)); fx /= g; fy /= g; if (fx < 0) { fx *= -1; fy *= -1; } pll p = pll(fx, fy); pll c = pll(cx, cy); mp[pair(p, c)]++; } } } ll ans = 0; for (auto itr = mp.begin(); itr != mp.end(); itr++) { ll px = (itr->first).first.first; ll py = (itr->first).first.second; ll cx = (itr->first).second.first; ll cy = (itr->first).second.second; // debug_out(px, py, cx, cy, itr->second); if (px == 0) { pll p = pll(1, 0); pll c = pll(cx, cy); ans += itr->second * mp[pair(p, c)]; } else if (py == 0) { pll p = pll(0, 1); pll c = pll(cx, cy); ans += itr->second * mp[pair(p, c)]; } else { if (py < 0) { py *= -1; px *= -1; } pll p = pll(py, -px); pll c = pll(cx, cy); ans += itr->second * mp[pair(p, c)]; } } cout << ans / 2 << endl; }