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 N = 100005;
const int INF = (1 << 29);
const int mod = 1000007;
int a, b, c, d, e, f, g, h, i, j, k;
pair<int, int> G[N];
vector<long long> hav[2][1000025];
vector<int> GG[N], Big;
int tot, type[N];
int max_x = -INF, max_y = -INF, min_x = INF, min_y = INF;
int an;
inline long long Num(int x, int y) {
  return 2000000LL * ((long long)x + 2000000 - 1) + ((long long)y + 2000000);
}
inline bool Hash(vector<long long> uu[], int x, int y) {
  long long tt = Num(x, y);
  for (int ii = 0; ii < uu[tt % mod].size(); ii++)
    if (uu[tt % mod][ii] == tt) return true;
  return false;
}
inline void Check1(int x, int y) {
  int delta = G[y].second - G[x].second;
  if (G[x].first - delta >= min_x &&
      Hash(hav[0], G[x].first - delta, G[x].second) &&
      Hash(hav[0], G[x].first - delta, G[y].second))
    an++;
  if (G[x].first - delta >= min_x &&
      Hash(hav[1], G[x].first - delta, G[x].second) &&
      Hash(hav[1], G[x].first - delta, G[y].second))
    an++;
  if (G[x].first + delta <= max_x &&
      Hash(hav[1], G[x].first + delta, G[x].second) &&
      Hash(hav[1], G[x].first + delta, G[y].second))
    an++;
}
inline void Check2(int x, int y) {
  int delta = G[y].first - G[x].first;
  if (G[x].second - delta >= min_y &&
      Hash(hav[1], G[x].first, G[x].second - delta) &&
      Hash(hav[1], G[y].first, G[y].second - delta))
    an++;
}
int main() {
  cin >> a;
  for (i = 1; i <= a; i++) {
    scanf("%d%d", &G[i].first, &G[i].second);
    max_x = max(max_x, G[i].first);
    max_y = max(max_y, G[i].second);
    min_x = min(min_x, G[i].first);
    min_y = min(min_y, G[i].second);
  }
  sort(G + 1, G + a + 1);
  for (i = 1; i <= a; i++) {
    if (i == 1 || G[i].first != G[i - 1].first) tot++;
    GG[tot].push_back(i);
  }
  int siz = (int)sqrt((double)a);
  for (i = 1; i <= tot; i++) {
    int vv = 1;
    if (GG[i].size() <= siz)
      vv = 0;
    else
      Big.push_back(i);
    for (j = 0; j < GG[i].size(); j++) {
      long long tt = Num(G[GG[i][j]].first, G[GG[i][j]].second);
      hav[vv][tt % mod].push_back(tt);
    }
  }
  int Cnt = 0;
  for (i = 1; i <= tot; i++)
    if (GG[i].size() <= siz) {
      Cnt += GG[i].size() * GG[i].size();
      for (j = 0; j < GG[i].size(); j++)
        for (k = j + 1; k < GG[i].size(); k++) Check1(GG[i][j], GG[i][k]);
    }
  for (i = 0; i < Big.size(); i++)
    for (j = i + 1; j < Big.size(); j++) {
      c = Big[i], d = Big[j];
      vector<pair<int, int> > u;
      for (k = 0; k < GG[d].size(); k++)
        u.push_back(make_pair(G[GG[d][k]].second, GG[d][k]));
      int pos = 0;
      for (k = 0; k < GG[c].size(); k++) {
        while (pos < u.size() && G[GG[c][k]].second > u[pos].first) pos++;
        if (pos == u.size()) break;
        if (G[GG[c][k]].second < u[pos].first) continue;
        Check2(GG[c][k], u[pos].second);
      }
    }
  cout << an << endl;
  return 0;
}
