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

// practice with rainboy
import java.io.*;
import java.util.*;

public class CF425D extends PrintWriter {
	CF425D() { super(System.out, true); }
	Scanner sc = new Scanner(System.in);
	public static void main(String[] $) {
		CF425D o = new CF425D(); o.main(); o.flush();
	}

	static final int K = 200, Y = 100000;
	static class P {
		int x, y;
		P(int x, int y) {
			this.x = x; this.y = y;
		}
	}
	static Random rand = new Random();
	static class V {
		V l, r;
		long key;
		int x;
		V(long key) {
			this.key = key;
			x = rand.nextInt();
		}
	}
	V v_, l_, r_;
	void split(V v, long key) {
		if (v == null) {
			v_ = l_ = r_ = null;
		} else if (v.key < key) {
			split(v.r, key);
			v.r = l_; l_ = v;
		} else if (v.key > key) {
			split(v.l, key);
			v.l = r_; r_ = v;
		} else {
			v_ = v; l_ = v.l; r_ = v.r;
			v.l = v.r = null;
		}
	}
	V merge(V u, V v) {
		if (u == null)
			return v;
		if (v == null)
			return u;
		if (u.x < v.x) {
			u.r = merge(u.r, v);
			return u;
		} else {
			v.l = merge(u, v.l);
			return v;
		}
	}
	boolean has(long key) {
		split(v_, key);
		boolean ans = v_ != null;
		v_ = merge(l_, merge(v_, r_));
		return ans;
	}
	void add(long key) {
		split(v_, key);
		if (v_ == null)
			v_ = new V(key);
		v_ = merge(l_, merge(v_, r_));
	}
	long compose(int x, int y) {
		return (long) x * (Y + 1) + y;
	}
	void main() {
		int n = sc.nextInt();
		P[] pp = new P[n];
		for (int i = 0; i < n; i++) {
			int x = sc.nextInt();
			int y = sc.nextInt();
			pp[i] = new P(x, y);
			add(compose(x, y));
		}
		int[] ll = new int[Y + 1];
		int[] rr = new int[Y + 1]; Arrays.fill(rr, -1);
		Arrays.sort(pp, (p, q) -> p.y != q.y ? p.y - q.y : p.x - q.x);
		int[] yy = new int[n]; int cnt = 0;
		for (int i = 0, j; i < n; i = j) {
			int y = pp[i].y;
			j = i + 1;
			while (j < n && pp[j].y == y)
				j++;
			ll[y] = i; rr[y] = j;
			if (j - i > K)
				yy[cnt++] = y;
		}
		int ans = 0;
		for (int h = 0; h < cnt; h++) {
			int y = yy[h], l = ll[y], r = rr[y];
			for (int h_ = h + 1; h_ < cnt; h_++) {
				int y_ = yy[h_], l_ = ll[y_], r_ = rr[y_];
				for (int i = l, j = l, i_ = l_, j_ = l_; i < r && j < r && i_ < r_ && j_ < r_; i++) {
					int x = pp[i].x, x_ = x + y_ - y;
					while (j < r && pp[j].x < x_)
						j++;
					if (j < r && pp[j].x == x_) {
						while (i_ < r_ && pp[i_].x < x)
							i_++;
						if (i_ < r_ && pp[i_].x == x) {
							while (j_ < r_ && pp[j_].x < x_)
								j_++;
							if (j_ < r_ && pp[j_].x == x_)
								ans++;
						}
					}
				}
			}
		}
		for (int y = 0; y <= Y; y++) {
			int l = ll[y], r = rr[y];
			if (r - l > K)
				continue;
			for (int i = l; i < r; i++)
				for (int j = i + 1; j < r; j++) {
					int x = pp[i].x, x_ = pp[j].x, y_, l_, r_;
					y_ = y - (x_ - x);
					if (y_ >= 0 && rr[y_] - ll[y_] > K && has(compose(x, y_)) && has(compose(x_, y_)))
						ans++;
					y_ = y + (x_ - x);
					if (y_ <= Y && rr[y_] - ll[y_] > 0 && has(compose(x, y_)) && has(compose(x_, y_)))
						ans++;
				}
		}
		println(ans);
	}
}
