81
9 4
6 8
6 4
4 6
4 8
9 10
0 2
5 4
8 9
7 7
10 5
4 4
7 8
3 7
2 1
5 5
2 7
8 6
2 8
10 7
5 8
0 10
10 0
4 9
4 2
10 3
6 6
3 8
5 3
8 8
10 9
1 1
0 9
8 1
1 8
0 7
10 4
3 6
7 6
1 9
8 3
8 10
4 5
3 4
7 5
2 0
0 6
2 4
7 4
6 3
1 6
10 8
1 5
6 5
0 0
9 0
7 3
3 2
2 6
4 0
8 7
10 10
3 0
0 5
3 9
5 1
6 0
1 4
0 1
1 2
6 2
9 7
6 10
1 3
1 7
2 5
5 10
10 2
5 6
6 7
2 3
 1
0 0
 3
5 1
4 1
2 6
 54
0 8
3 2
9 3
7 2
8 2
2 8
10 10
7 6
1 1
9 7
4 0
6 10
10 1
10 8
5 1
0 4
7 10
3 6
0 5
4 3
3 0
5 10
6 9
5 4
6 6
8 5
0 7
5 8
1 2
2 2
9 4
2 4
0 10
5 9
10 9
7 9
9 9
2 5
4 10
8 9
7 7
5 2
6 5
4 1
10 6
6 3
9 6
0 9
7 3
7 5
8 4
1 3
0 3
2 10
 49
2 9
7 0
8 0
10 3
2 10
6 10
6 2
9 7
1 9
4 6
5 4
1 0
9 4
6 9
5 6
7 9
10 10
8 2
3 10
0 8
4 4
5 7
0 0
9 1
0 7
2 0
1 7
10 0
3 5
8 5
6 4
0 4
2 7
4 1
10 2
2 4
8 4
0 9
3 4
4 9
7 7
10 9
2 3
7 2
5 8
4 7
10 8
7 6
1 8
 72
8 2
2 4
3 5
9 10
7 6
1 5
0 0
3 3
1 6
7 10
8 8
7 9
6 0
3 6
9 3
8 1
3 4
3 7
0 7
10 8
2 6
6 8
0 6
5 6
6 6
6 5
6 4
0 2
9 9
4 8
7 2
8 0
9 4
0 10
4 5
9 8
10 3
8 7
8 5
7 7
6 7
5 7
5 4
8 4
3 2
7 3
9 0
0 8
0 5
3 9
2 10
7 1
4 3
1 10
3 0
5 9
10 1
6 1
4 10
1 0
2 1
2 0
3 8
10 7
7 4
0 9
1 1
1 8
8 3
5 2
6 3
4 2
 71
5 3
1 10
10 3
5 2
3 5
10 9
10 2
1 5
9 5
8 9
2 3
2 6
8 4
6 3
0 2
9 4
2 0
7 7
10 0
4 0
1 4
1 6
4 5
6 1
8 2
0 0
0 1
3 7
3 10
4 8
4 6
3 8
1 0
9 10
9 9
6 5
7 1
10 1
6 6
3 4
4 3
4 2
4 10
9 6
7 3
6 8
5 5
4 9
0 7
0 9
8 10
2 7
1 7
7 2
5 8
1 2
3 6
10 8
0 8
3 1
1 3
9 3
7 6
6 7
4 4
0 3
2 2
5 10
2 9
0 5
7 0
 3
1 6
10 8
4 3
 1
100000 100000
 87
5 10
5 0
9 2
2 4
6 6
4 4
3 4
0 3
10 6
1 0
7 1
2 5
6 10
5 3
1 6
8 7
5 6
5 9
9 8
2 6
6 9
6 4
3 2
10 10
0 4
8 9
8 8
4 8
10 2
10 0
3 8
8 2
3 1
9 5
9 1
5 4
4 6
10 7
2 0
10 9
9 0
9 9
6 2
3 9
10 8
7 0
7 3
6 0
5 2
6 5
4 7
1 3
9 7
1 5
4 1
7 10
0 2
0 8
9 10
0 5
4 10
7 4
1 8
2 7
10 3
9 3
10 5
6 1
8 3
10 1
8 0
5 1
3 10
10 4
2 10
4 5
5 7
7 9
1 7
8 6
1 1
7 2
7 5
5 5
1 4
6 8
6 3

85
 0
 0
 14
 11
 51
 40
 0
 0
 101

#include <bits/stdc++.h>
using namespace std;
set<int> xps[101010];
set<int> yps[101010];
set<pair<int, int> > xs;
set<pair<int, int> > ys;
void rm(int x, int y) {
  int exc = xps[x].size();
  int eyc = yps[y].size();
  xs.erase({exc, x});
  ys.erase({eyc, y});
  xps[x].erase(y);
  yps[y].erase(x);
  if (exc > 1) {
    xs.insert({exc - 1, x});
  }
  if (eyc > 1) {
    ys.insert({eyc - 1, y});
  }
}
int is(int x, int y) { return xps[x].count(y) > 0; }
int x[101010];
int y[101010];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
  }
  for (int i = 0; i < n; i++) {
    xps[x[i]].insert(y[i]);
    yps[y[i]].insert(x[i]);
  }
  for (int i = 0; i <= n; i++) {
    if ((int)xps[i].size() > 0) {
      xs.insert({(int)xps[i].size(), i});
    }
    if ((int)yps[i].size() > 0) {
      ys.insert({(int)yps[i].size(), i});
    }
  }
  int v = 0;
  while ((int)xs.size() > 0 || (int)ys.size() > 0) {
    if ((int)xs.size() == 0 || (((int)xs.size() > 0 && (int)ys.size() > 0) &&
                                (*ys.begin()).first < (*xs.begin()).first)) {
      vector<int> xx;
      int ty = (*ys.begin()).second;
      for (int kx : yps[ty]) {
        xx.push_back(kx);
      }
      for (int i = 0; i < (int)xx.size(); i++) {
        for (int ii = i + 1; ii < (int)xx.size(); ii++) {
          int d = abs(xx[ii] - xx[i]);
          int ny1 = ty + d;
          int ny2 = ty - d;
          if (is(xx[i], ny1) && is(xx[ii], ny1)) v++;
          if (is(xx[i], ny2) && is(xx[ii], ny2)) v++;
        }
      }
      for (int i = 0; i < (int)xx.size(); i++) {
        rm(xx[i], ty);
      }
    } else {
      vector<int> yy;
      int tx = (*xs.begin()).second;
      for (int ky : xps[tx]) {
        yy.push_back(ky);
      }
      for (int i = 0; i < (int)yy.size(); i++) {
        for (int ii = i + 1; ii < (int)yy.size(); ii++) {
          int d = abs(yy[ii] - yy[i]);
          int nx1 = tx + d;
          int nx2 = tx - d;
          if (is(nx1, yy[ii]) && is(nx1, yy[i])) v++;
          if (is(nx2, yy[ii]) && is(nx2, yy[i])) v++;
        }
      }
      for (int i = 0; i < (int)yy.size(); i++) {
        rm(tx, yy[i]);
      }
    }
  }
  cout << v << endl;
}
