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;
const int maxn = 1e5 + 10;
map<int, int> m1, m2;
vector<int> t1[maxn], t2[maxn];
int g1[maxn], g2[maxn], tot, tot2, s1[maxn], s2[maxn];
int size1[maxn], size2[maxn], del[maxn], vis1[maxn], vis2[maxn];
struct point {
  int x, y;
} p[maxn];
queue<int> q1, q2;
vector<int> tmp;
vector<pair<int, int> > h[maxn];
const int lim = 1e5;
int limsize = 400;
bool check(int x, int y) {
  if (x < 0 || y < 0 || x > lim || y > lim) return 0;
  vector<pair<int, int> >::iterator it =
      lower_bound(h[x].begin(), h[x].end(), make_pair(y, 0));
  if (it == h[x].end()) return 0;
  if ((*it).first != y || del[(*it).second]) return 0;
  return 1;
}
int main() {
  int n, ans = 0;
  cin >> n;
  limsize = sqrt(n) + 2;
  for (int i = 1; i <= n; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    h[x].push_back(make_pair(y, i));
    p[i].x = x;
    p[i].y = y;
    map<int, int>::iterator it = m1.find(x);
    if (it == m1.end()) {
      m1[x] = ++tot;
      t1[tot].push_back(i);
      g1[tot] = x;
      size1[tot] = 1;
      s1[i] = tot;
    } else {
      int id = (*it).second;
      t1[id].push_back(i);
      size1[id]++;
      s1[i] = id;
    }
    it = m2.find(y);
    if (it == m2.end()) {
      m2[x] = ++tot2;
      g2[tot2] = y;
      t2[tot2].push_back(i);
      size2[tot2] = 1;
      s2[i] = tot2;
    } else {
      int id = (*it).second;
      t2[id].push_back(i);
      size2[id]++;
      s2[i] = id;
    }
  }
  for (int i = 0; i <= lim; ++i) sort(h[i].begin(), h[i].end());
  for (int i = 1; i <= tot; ++i)
    if (size1[i] <= limsize) {
      q1.push(i);
      vis1[i] = 1;
    }
  for (int i = 1; i <= tot2; ++i)
    if (size2[i] <= limsize) {
      q2.push(i);
      vis2[i] = 1;
    }
  while (tot + tot2) {
    while (!q1.empty()) {
      int now = q1.front();
      q1.pop();
      int x = g1[now];
      tmp.clear();
      tot--;
      for (int i = 0; i < t1[now].size(); ++i)
        if (!del[t1[now][i]]) tmp.push_back(t1[now][i]);
      for (int i = 0; i < tmp.size(); ++i)
        for (int j = i + 1; j < tmp.size(); ++j) {
          point p1 = p[tmp[i]], p2 = p[tmp[j]];
          int delta = abs(p1.y - p2.y);
          if (check(x + delta, p1.y) && check(x + delta, p2.y)) ++ans;
          if (check(x - delta, p1.y) && check(x - delta, p2.y)) ++ans;
        }
      for (int i = 0; i < tmp.size(); ++i) {
        int id = tmp[i];
        del[id] = 1;
        --size2[s2[id]];
        if (!vis2[s2[id]] && size2[s2[id]] <= limsize) {
          vis2[s2[id]] = 1;
          q2.push(s2[id]);
        }
      }
    }
    while (!q2.empty()) {
      int now = q2.front();
      q2.pop();
      int y = g2[now];
      tmp.clear();
      tot2--;
      for (int i = 0; i < t2[now].size(); ++i)
        if (!del[t2[now][i]]) tmp.push_back(t2[now][i]);
      for (int i = 0; i < tmp.size(); ++i)
        for (int j = i + 1; j < tmp.size(); ++j) {
          point p1 = p[tmp[i]], p2 = p[tmp[j]];
          int delta = abs(p1.x - p2.x);
          if (check(p1.x, y + delta) && check(p2.x, y + delta)) ++ans;
          if (check(p1.x, y - delta) && check(p2.x, y - delta)) ++ans;
        }
      for (int i = 0; i < tmp.size(); ++i) {
        int id = tmp[i];
        del[id] = 1;
        --size1[s1[id]];
        if (!vis1[s1[id]] && size1[s1[id]] <= limsize) {
          vis1[s1[id]] = 1;
          q1.push(s1[id]);
        }
      }
    }
  }
  cout << ans << endl;
  return 0;
}
