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.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;


public class C {
	static final long thing =100005;
	static final int size = 100005;
	public static void main(String[] args) {
		FasterScanner sc = new FasterScanner();
		PrintWriter out = new PrintWriter(System.out);
		
		int N = sc.nextInt();
		
		Points[] P = new Points[N];
		for(int a=0;a<N;a++){
			P[a]=new Points(sc.nextInt(),sc.nextInt());
		}
		Arrays.sort(P);
		
		
		
		
		int[] X = new int[N];
		int[] Y = new int[N];
		int[] D = new int[N];
		long[] HASH = new long[N];
		
		HashSet<Integer> ROW[] = new HashSet[size];
		HashSet<Integer> COL[]= new HashSet[size];
		HashSet<Long> DIA[] = new HashSet[size*2];
//		for(int a=0;a<size;a++){
//			ROW[a]=new HashSet<Integer>();
//			COL[a]=new HashSet<Integer>();
//		}
//		for(int a=0;a<size*2;a++){
//			DIA[a] = new HashSet<Long>();
//		}
//		
		
		//init
		
		for(int a=0;a<N;a++){
			X[a]=P[a].x;
			Y[a]=P[a].y;
			HASH[a]= HASH(X[a],Y[a]);
			D[a] = diag(X[a],Y[a]);
			
			if(ROW[Y[a]]==null)ROW[Y[a]]=new HashSet<Integer>();
			ROW[Y[a]].add(X[a]);

			if(COL[X[a]]==null)COL[X[a]]=new HashSet<Integer>();
			COL[X[a]].add(Y[a]);

			if(DIA[D[a]]==null)DIA[D[a]]=new HashSet<Long>();
			DIA[D[a]].add(HASH[a]);
		}
		
		
		long count = 0;
		
		for(int a=0;a<N;a++){
			int U = COL[X[a]].size();
			int R = ROW[Y[a]].size();
			int DG = DIA[D[a]].size();
			COL[X[a]].remove(Y[a]);
			ROW[Y[a]].remove(X[a]);
			DIA[D[a]].remove(HASH[a]);
			
			//up
			if(U<=R&&U<=DG){
				for(Integer y : COL[X[a]]){
					if(Y[a]==y)continue;
					int disp = y-Y[a];
					int targetx = X[a]+disp;
					if(X[a]==targetx)continue;
					if(targetx<0||targetx>=size)continue;
					if(ROW[Y[a]].contains(targetx)&&
							DIA[D[a]].contains(HASH(targetx,y)))count++;
				}
			}
			//right
			else if(R<=U&&R<=DG){
				for(Integer x : ROW[Y[a]]){
					if(X[a]==x)continue;
					int disp = x-X[a];
					int targety = Y[a]+disp;
					if(Y[a]==targety)continue;
					if(targety<0||targety>=size)continue;
					if(COL[X[a]].contains(targety)&&
							DIA[D[a]].contains(HASH(x,targety)))count++;
				}
			}
			//dia
			else{
				for(Long H : DIA[D[a]]){
					int[] unhash = UNHASH(H);
					int tx = unhash[0];
					int ty = unhash[1];
					if(X[a]==tx||Y[a]==ty)continue;
					if(COL[X[a]].contains(ty)&&
							(ROW[Y[a]].contains(tx))){
					//	System.out.println(X[a]+","+Y[a]+" "+tx+" "+ty);
						count++;
					}
				}
			}
			
		}
		
		
		
		out.println(count);
		
		
		out.close();
	}
	static class Points implements Comparable<Points>{
		int x,y;
		Points(int xx ,int yy){
			x=xx;
			y=yy;
		}
		@Override
		public int compareTo(Points o) {
			if(this.x==o.x)return this.y-o.y;
			return this.x-o.x;
		}
	}

	private static int diag(int x, int y) {
		return 100001-x+y;
	}

	static long HASH(long x, long y){
		return x*thing + y;
	}
	
	static int[] UNHASH(long x){
		return new int[]{(int)(x/thing), (int)(x%thing)};
	}
	
	static class FasterScanner{
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;
		
		public FasterScanner(){
			stream = System.in;
			//stream = new FileInputStream(new File("dec.in"));

		}
		int read(){
			if(numChars==-1)
				throw new InputMismatchException();
			if(curChar>=numChars){
				curChar = 0;
				try{
					numChars = stream.read(buf);
				} catch (IOException e){
					throw new InputMismatchException();
				}
				if(numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
		
		boolean isSpaceChar(int c){
			return c==' '||c=='\n'||c=='\r'||c=='\t'||c==-1;
		}
		boolean isEndline(int c){
			return c=='\n'||c=='\r'||c==-1;
		}
		int nextInt(){
			return Integer.parseInt(next());
		}
		long nextLong(){
			return Long.parseLong(next());
		}
		double nextDouble(){
			return Double.parseDouble(next());
		}
		String next(){
			int c = read();
			while(isSpaceChar(c))
				c=read();
			StringBuilder res = new StringBuilder();
			do{
				res.appendCodePoint(c);
				c=read();
			} while(!isSpaceChar(c));
			return res.toString();
		}
		String nextLine(){
			int c = read();
			while(isEndline(c))
				c=read();
			StringBuilder res = new StringBuilder();
			do{
				res.appendCodePoint(c);
				c = read();
			}while(!isEndline(c));
			return res.toString();
		}
		
	}
}
