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 MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return a > val ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
const int MAXN = 7654321;
const int NOTFOUND = -1;
struct HashMap {
  int cur, head[MAXN], next[MAXN];
  long long l[MAXN];
  int x[MAXN];
  HashMap() {
    cur = 0;
    fill_n(head, MAXN, 0);
    fill_n(next, MAXN, 0);
  }
  int find(long long key) {
    for (int i = head[key % MAXN]; i; i = next[i]) {
      if (l[i] == key) {
        return x[i];
      }
    }
    return NOTFOUND;
  }
  void erase(long long key) {
    for (int i = head[key % MAXN]; i; i = next[i]) {
      if (l[i] == key) {
        x[i] = NOTFOUND;
      }
    }
  }
  void insert(long long key, int val) {
    if (find(key) != NOTFOUND) return;
    l[++cur] = key;
    x[cur] = val;
    next[cur] = head[key % MAXN];
    head[key % MAXN] = cur;
  }
} hm;
long long phash(int u, int v) { return (((long long)u) << 20) + v; }
const int maxn = 100010;
const int magic = 320;
int n;
vector<int> ax[maxn];
vector<int> ay[maxn];
void solve() {
  cin >> n;
  for (int i = (0); i < (n); i++) {
    int u, v;
    cin >> u >> v;
    ax[u].push_back(v);
    hm.insert(phash(u, v), 1);
  }
  int ans = 0;
  for (int i = (0); i < (maxn); i++) {
    if (int((ax[i]).size()) < magic) {
      for (int j = (0); j < (int((ax[i]).size())); j++) {
        for (int k = (j + 1); k < (int((ax[i]).size())); k++) {
          int p = abs(ax[i][j] - ax[i][k]);
          if (i - p >= 0 && hm.find(phash(i - p, ax[i][j])) != NOTFOUND &&
              hm.find(phash(i - p, ax[i][k])) != NOTFOUND) {
            ans++;
          }
          if (i + p < maxn && hm.find(phash(i + p, ax[i][j])) != NOTFOUND &&
              hm.find(phash(i + p, ax[i][k])) != NOTFOUND) {
            ans++;
          }
        }
        hm.erase(phash(i, ax[i][j]));
      }
    } else {
      for (int j = (0); j < (int((ax[i]).size())); j++) {
        ay[ax[i][j]].push_back(i);
      }
    }
  }
  for (int i = (0); i < (maxn); i++) {
    for (int j = (0); j < (int((ay[i]).size())); j++) {
      for (int k = (j + 1); k < (int((ay[i]).size())); k++) {
        int p = abs(ay[i][j] - ay[i][k]);
        if (i - p >= 0 && hm.find(phash(ay[i][j], i - p)) != NOTFOUND &&
            hm.find(phash(ay[i][k], i - p)) != NOTFOUND) {
          ans++;
        }
        if (i + p < maxn && hm.find(phash(ay[i][j], i + p)) != NOTFOUND &&
            hm.find(phash(ay[i][k], i + p)) != NOTFOUND) {
          ans++;
        }
      }
      hm.erase(phash(ay[i][j], i));
    }
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
