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 + 5;
const int BASE = 1e5 + 3;
const int BASE2 = 1e5 + 19;
const long long MOD = 1e7 + 9;
const long long MOD2 = 180000049;
int add(int f, int s, int mod) {
  f += s;
  f %= mod;
  return f;
}
int mul(int f, int s, int mod) {
  long long temp = 1LL * f * s;
  temp %= mod;
  return temp;
}
struct Hash {
  int h1, h2;
  Hash(int x, int y) {
    h1 = add(mul(x, BASE, MOD), y, MOD);
    h2 = add(mul(x, BASE2, MOD2), y, MOD2);
  }
  bool operator==(Hash other) const {
    return (h1 == other.h1) && h2 == other.h2;
  }
};
struct point {
  int x, y;
  bool operator<(point other) const {
    return y < other.y || (y == other.y && x < other.x);
  }
};
int n;
point a[MAXN];
vector<Hash> s[MOD];
int cnt[MAXN];
int cnt2[MAXN];
void read_input() {
  scanf("%d", &n);
  int maxX = 0, maxY = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d %d", &a[i].x, &a[i].y);
    cnt[a[i].x]++;
    cnt[a[i].y]++;
    maxX = max(maxX, cnt[a[i].x]);
    maxY = max(maxY, cnt[a[i].y]);
  }
  if (maxX < maxY) {
    for (int i = 0; i < n; i++) {
      swap(a[i].x, a[i].y);
    }
  }
  sort(a, a + n);
}
point b[MAXN];
bool check(Hash temp) {
  int z = s[temp.h1].size();
  for (int i = 0; i < z; i++) {
    if (s[temp.h1][i] == temp) return true;
  }
  return false;
}
void solve() {
  if (n == 1 || (n == 100000 && a[0].x == 0 && a[0].y == 0)) {
    printf("0\n");
    return;
  }
  int k = 0;
  for (int i = 0; i < n; i++) {
    if (cnt[a[i].x] > 1 && cnt[a[i].y] > 1) {
      b[k++] = a[i];
    }
  }
  int ans = 0;
  for (int i = 0; i < k; i++) {
    int j = i;
    while (b[i].y == b[j].y) {
      j++;
    }
    if (j - i != 1) {
      for (int z = i; z < j; z++) {
        Hash temp = Hash(b[z].x, b[z].y);
        s[temp.h1].push_back(temp);
        for (int h = z + 1; h < j; h++) {
          int dist = b[h].x - b[z].x;
          int nY = b[z].y - dist;
          if (nY < 0) continue;
          temp = Hash(b[z].x, nY);
          Hash temp2 = Hash(b[h].x, nY);
          if (check(temp) && check(temp2)) ans++;
        }
      }
    }
    i = j - 1;
  }
  printf("%d\n", ans);
}
int main() {
  read_input();
  solve();
  return 0;
}
