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

import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Random;
import java.util.StringTokenizer;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskD solver = new TaskD();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskD {
    static final long MAX_COORD = (int) 1e5 + 1;
    static final int MAX_HASH = 1 << 20;

    long[] existing;
    int[] nextSameHash;
    int[] firstByHash;
    long hashZ;
    boolean check(int x, int y, int size) {
        if (size <= 0 || x < 0 || y < 0 || x + size >= MAX_COORD || y + size >= MAX_COORD) return false;
        {
            long key = (x + size) * MAX_COORD + y;
            long h = (x + size) * hashZ + y;
            int ih = (int) ((h ^ (h >> 20) ^ (h >> 40) ^ (h >> 60)) & (MAX_HASH - 1));
            int cur = firstByHash[ih];
            boolean ok = false;
            while (cur >= 0) {
                if (existing[cur] == key) {
                    ok = true;
                    break;
                }
                cur = nextSameHash[cur];
            }
            if (!ok) return false;
        }
        {
            long key = (x + size) * MAX_COORD + (y + size);
            long h = (x + size) * hashZ + (y + size);
            int ih = (int) ((h ^ (h >> 20) ^ (h >> 40) ^ (h >> 60)) & (MAX_HASH - 1));
            int cur = firstByHash[ih];
            boolean ok = false;
            while (cur >= 0) {
                if (existing[cur] == key) {
                    ok = true;
                    break;
                }
                cur = nextSameHash[cur];
            }
            if (!ok) return false;
        }
        {
            long key = x * MAX_COORD + (y + size);
            long h = x * hashZ + (y + size);
            int ih = (int) ((h ^ (h >> 20) ^ (h >> 40) ^ (h >> 60)) & (MAX_HASH - 1));
            int cur = firstByHash[ih];
            boolean ok = false;
            while (cur >= 0) {
                if (existing[cur] == key) {
                    ok = true;
                    break;
                }
                cur = nextSameHash[cur];
            }
            if (!ok) return false;
        }
        return true;
    }

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        Random random = new Random(543715431L + System.currentTimeMillis());
        int n = in.nextInt();
        hashZ = random.nextLong() * 2 + 1;
        int[] x = new int[n];
        int[] y = new int[n];
        existing = new long[n];
        for (int i = 0; i < n; ++i) {
            x[i] = in.nextInt();
            y[i] = in.nextInt();
            existing[i] = x[i] * (long) MAX_COORD + y[i];
        }
        for (int i = 0; i < n; ++i) {
            int j = random.nextInt(n - i) + i;
            long t = existing[i];
            existing[i] = existing[j];
            existing[j] = t;
        }
        Arrays.sort(existing);
        for (int i = 0; i < n; ++i) {
            x[i] = (int) (existing[i] / MAX_COORD);
            y[i] = (int) (existing[i] % MAX_COORD);
        }
        nextSameHash = new int[n];
        firstByHash = new int[MAX_HASH];
        Arrays.fill(firstByHash, -1);
        for (int i = 0; i < n; ++i) {
            long h = x[i] * hashZ + y[i];
            int ih = (int) ((h ^ (h >> 20) ^ (h >> 40) ^ (h >> 60)) & (MAX_HASH - 1));
            nextSameHash[i] = firstByHash[ih];
            firstByHash[ih] = i;
        }
        int[] countX = new int[(int) MAX_COORD];
        int[] countY = new int[(int) MAX_COORD];
        int[] countXminusY = new int[(int) (2 * MAX_COORD)];
        int[] firstX = new int[(int) MAX_COORD];
        int[] firstY = new int[(int) MAX_COORD];
        int[] firstXminusY = new int[(int) (2 * MAX_COORD)];
        Arrays.fill(firstX, -1);
        Arrays.fill(firstY, -1);
        Arrays.fill(firstXminusY, -1);
        int[] nextX = new int[n];
        int[] nextY = new int[n];
        int[] nextXminusY = new int[n];
        int res = 0;
        for (int i = n - 1; i >= 0; --i) {
            int cx = countX[x[i]];
            int cy = countY[y[i]];
            int cxmy = countXminusY[((int) (x[i] - y[i] + MAX_COORD))];
            if (cx <= cy && cx <= cxmy) {
                int cur = firstX[x[i]];
                while (cur >= 0) {
                    if (check(x[i], y[i], y[cur] - y[i])) ++res;
                    cur = nextX[cur];
                }
            } else if (cy <= cxmy) {
                int cur = firstY[x[i]];
                while (cur >= 0) {
                    if (check(x[i], y[i], x[cur] - x[i])) ++res;
                    cur = nextY[cur];
                }
            } else {
                int cur = firstXminusY[x[i]];
                while (cur >= 0) {
                    if (check(x[i], y[i], x[cur] - x[i])) ++res;
                    cur = nextXminusY[cur];
                }
            }
            ++countX[x[i]];
            ++countY[y[i]];
            ++countXminusY[((int) (x[i] - y[i] + MAX_COORD))];
            nextX[i] = firstX[x[i]];
            firstX[x[i]] = i;
            nextY[i] = firstY[y[i]];
            firstY[y[i]] = i;
            nextXminusY[i] = firstXminusY[((int) (x[i] - y[i] + MAX_COORD))];
            firstXminusY[((int) (x[i] - y[i] + MAX_COORD))] = i;
        }
        out.println(res);
    }
}

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

}

