#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,avx,fma,avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;

void solve() {
  int n;
  cin >> n;

  vector<pair<int, int>> v(n);
  for (auto &p : v)
    cin >> p.first >> p.second;

  map<pair<int, int>, int> m;
  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      int dx = (v[i].first - v[j].first);
      int dy = (v[i].second - v[j].second);

      int d = gcd(abs(dx), abs(dy));
      dx /= d, dy /= d;
      if (dx < 0 || (dx == 0 && dy < 0))
        dx = -dx, dy = -dy;
      cout << dx << ' ' << dy << endl;
      m[make_pair(dx, dy)]++;
    }
  }

  cout << endl;
  long long ans = 0;
  for (auto [k, v] : m) {
    if (v <= 1)
      continue;

    cout << k.first << ' ' << k.second << ": " << v << endl;

    ans += v * 1LL * (v - 1) / 2;
  }

  cout << ans << endl;
}

int main() {
  freopen("trapez.in", "r", stdin);
  freopen("trapez.out", "w", stdout);
  int t = 1;
  // cin >> t;
  while (t--)
    solve();

  return 0;
}