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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;

public class F {
    
    static class p {
        int x, y, i;
        p(int i, int x, int y) {this.i=i; this.x=x; this.y=y;}
        
        public String toString() { return x+":"+y; };
    }
    
    static int solve(int[] x, int[] y) {
        int N=x.length, maxx=0, maxy=0;
        
        p[] pts=new p[N];
        for (int i=0; i<N; i++) {
            pts[i]=new p(i,x[i],y[i]);
            if(maxx<x[i]) {
                maxx=x[i];
            }
            if(maxy<y[i]) {
                maxy=y[i];
            }
        }
        
        map<Integer, p>[] x2p=new map[maxx+1];
        for (int i=0; i<=maxx; i++) {
            x2p[i]=new map<Integer, p>();
        }

        map<Integer, p>[] y2p=new map[maxy+1];
        for (int i=0; i<=maxy; i++) {
            y2p[i]=new map<Integer, p>();
        }
        
        for (int i=0; i<N; i++) {
            map<Integer, p> l=x2p[pts[i].x];
            l.put(pts[i].y, pts[i]);
        }

        for (int i=0; i<N; i++) {
            map<Integer, p> l=y2p[pts[i].y];
            l.put(pts[i].x, pts[i]);
        }
        
        int ret=0;
        
        for (int i=0; i<N; i++) {
            p pt=pts[i];
            if(x2p[pt.x].size<=y2p[pt.y].size) {
                map<Integer, p> l=x2p[pt.x];
                for (int j=0; j<l.size; j++) {
                    p pt2=(p)l.idx2v[j];
                    if(pt2.y>pt.y) {
                        int d=pt2.y-pt.y;
                        Integer key=pt.x+d;
                        if(y2p[pt.y].contains(key)&&y2p[pt2.y].contains(key)) {
                            ret++;
                        }
                    }
                }
            } else {
                map<Integer, p> l=y2p[pt.y];
                for (int j=0; j<l.size; j++) {
                    p pt2=(p)l.idx2v[j];
                    if(pt2.x>pt.x) {
                        int d=pt2.x-pt.x;
                        Integer key=pt.y+d;
                        if(x2p[pt.x].contains(key)&&x2p[pt2.x].contains(key)) {
                            ret++;
                        }
                    }
                }
            }
        }
        
        return ret;
    }

    
    
    
    
    static void run_stream(InputStream ins) throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int n=Integer.parseInt(br.readLine());
        int[] x=new int[n], y=new int[n];
        
        for (int i=0; i<n; i++) {
            String[] xy=br.readLine().split(" ");
            x[i]=Integer.parseInt(xy[0]);
            y[i]=Integer.parseInt(xy[1]);
        }
        
        System.out.println(solve(x, y));
    }

    public static void main(String[] args) throws IOException {
        run_stream(System.in);
    }


    
    
    
    static class map<K,V> {
        public int size=0;
        float load_factor;
        
        public int[] 
                bucket2idx,
                idx2n;
        
        public Object[] idx2k,idx2v;
        
        public map() {
            this(8, 0.75f);
        }
        
        public map(int capacity, float load_factor) {
            this.load_factor=load_factor;
            bucket2idx=new int[capacity];
            Arrays.fill(bucket2idx, -1);
            
            int data_size=(int)(capacity*load_factor)+1;
            idx2k=new Object[data_size];
            idx2v=new Object[data_size];
            idx2n=new int[data_size];
        }
        
        private int i2hash(int i) {
            i^=(i>>>20)^(i>>>12);
            return i^(i>>>7)^(i>>>4);
        }
        
        public boolean contains(K k) {
            int idx=bucket2idx[k2bucket(k)];
            while(idx>=0) {
                if(idx2k[idx].equals(k)) {
                    return true;
                } else {
                    idx=idx2n[idx];
                }
            }
            return false;
        }
        
        public V get(K k) {
            int idx=bucket2idx[k2bucket(k)];
            while(idx>=0) {
                if(idx2k[idx].equals(k)) {
                    return (V)idx2v[idx];
                } else {
                    idx=idx2n[idx];
                }
            }
            throw new IndexOutOfBoundsException();
        }
        
        public V put(K k, V v) {
            if(size>(int)(bucket2idx.length*load_factor)) {
                rehash(bucket2idx.length<<1);
            }
            
            int bucket_idx=k2bucket(k);
            int idx=bucket2idx[bucket_idx];
            if(idx>=0) {
                while(true) {
                    if(idx2k[idx].equals(k)) {
                        V oldv=(V)idx2v[idx];
                        idx2v[idx]=v;
                        return oldv;
                    } else if(idx2n[idx]<0) {
                        int idx2=size++;
                        idx2k[idx2]=k;
                        idx2v[idx2]=v;
                        idx2n[idx]=idx2;
                        idx2n[idx2]=-1;
                        return v;
                    } else {
                        idx=idx2n[idx];
                    }
                }
            } else {
                idx=size++;
                bucket2idx[bucket_idx]=idx;
                idx2k[idx]=k;
                idx2v[idx]=v;
                idx2n[idx]=-1;
                return v;
            }
        }

        protected int k2bucket(K k) {
            int bucket_idx=i2hash(k.hashCode())%bucket2idx.length;
            if(bucket_idx<0) {
                bucket_idx=bucket2idx.length+bucket_idx;
            }
            return bucket_idx;
        }

        void rehash(int new_capacity) {
            int[] _bucket2idx=new int[new_capacity];
            Arrays.fill(_bucket2idx, -1);
            
            int data_size=(int)(new_capacity*load_factor)+1;
            Object[] _idx2k=new Object[data_size];
            Object[] _idx2v=new Object[data_size];
            int[] _idx2n=new int[data_size];
            
            int old_size=size;
            size=0;
            //swap
            int[] aux=_bucket2idx; _bucket2idx=bucket2idx; bucket2idx=aux;
            aux=_idx2n; _idx2n=idx2n; idx2n=aux;

            Object[] oaux=_idx2k; _idx2k=idx2k; idx2k=oaux;
            oaux=_idx2v; _idx2v=idx2v; idx2v=oaux;
            //populate
            for(int i=0; i<old_size; i++) {
                put((K)_idx2k[i], (V)_idx2v[i]);
            }
        }
        
        public void clear() {
            if(size>0) {
                size=0;
                Arrays.fill(bucket2idx, -1);
            }
        }
        
        public void putAll(map<K,V> m) {
            int new_size=size+m.size;
            if(new_size>(int)(bucket2idx.length*load_factor)) {
                rehash((int)(1+new_size/load_factor));
            }
            for(int idx=0; idx<m.size; idx++) {
                put((K)m.idx2k[idx], (V)m.idx2v[idx]);
            }
        }
        
        public String toString() {
            if(size==0)
                return "{}";

            StringBuilder sb=new StringBuilder();
            sb.append('{');
            for(int i=0; i<size; i++) {
                sb.append(idx2k[i]);
                sb.append('=');
                sb.append(idx2v[i]);
                if(i<size-1) {
                    sb.append(", ");
                }
            }
            return sb.append('}').toString();
        }
    }
}
