#include<bits/stdc++.h>
using namespace std;
int main() {
  int N;
  cin >> N;
  map<pair<int, int>, int> m;
  vector<int> x(N), y(N);
  for (int i = 0; i < N; i++) {
    cin >> x[i] >> y[i];
    m[make_pair(x[i], y[i])] = i;
  }
  set<vector<int>>st;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      int dx = x[j] - x[i];
      int dy = y[j] - y[i];
      int nx = x[j], ny = y[j];
      vector<int> tmp = {i, j};
      int x2 = x[j] + dy;
      int y2 = y[j] - dx;
      int x3 = x2 - dx;
      int y3 = y2 - dy;
      pair<int, int> p2 = make_pair(x2, y2);
      pair<int, int> p3 = make_pair(x3, y3);
      if (m.count(p2) && m.count(p3)) {
        tmp.push_back(m[p2]);
        tmp.push_back(m[p3]);
      }
      sort(tmp.begin(), tmp.end());
      tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
      if (tmp.size() == 4) {
        st.insert(tmp);
      }
      tmp = {i, j};
      x2 = x[j] + dy;
      y2 = y[j] + dx;
      x3 = x2 - dx;
      y3 = y2 - dy;
      p2 = make_pair(x2, y2);
      p3 = make_pair(x3, y3);
      if (m.count(p2) && m.count(p3)) {
        tmp.push_back(m[p2]);
        tmp.push_back(m[p3]);
      }
      sort(tmp.begin(), tmp.end());
      tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
      if (tmp.size() != 4) continue;
      st.insert(tmp);
    }
  }
  // for (vector<int> p : st) {
  //   for (int w : p) {
  //     cout << w << ' ';
  //   }
  //   cout << endl;
  // }
  cout << st.size() << endl;
}