#include<bits/stdc++.h>

 using namespace std;

 #define N 2000006

 set<int>x[N],y[N];

 int n,a[N],b[N],ans=;

 int main()

 {

     scanf("%d",&n);

     for (int i=;i<=n;i++)

     {

         scanf("%d%d",&a[i],&b[i]);

         a[i]+=1e6;b[i]+=1e6;

         x[a[i]].insert(b[i]);

         y[b[i]].insert(a[i]);

     }

     for (int i=;i<=n;i++)

     {

         if (x[a[i]].size()<y[b[i]].size())

         {

         set<int>::iterator it=x[a[i]].upper_bound(b[i]);

         while (it!=x[a[i]].end())

         {

             int l=*it-b[i];

             if (a[i]+l<N)

             if (x[a[i]+l].find(b[i]+l)!=x[a[i]+l].end()  && x[a[i]+l].find(b[i])!=x[a[i]+l].end()) ans++;

             it++;

         }

         }else

         {

             set<int>::iterator it=y[b[i]].upper_bound(a[i]);

         while (it!=y[b[i]].end())

         {

             int l=*it-a[i];

             if (b[i]+l<N)

             if (y[b[i]+l].find(a[i]+l)!=y[b[i]+l].end()  && y[b[i]+l].find(a[i])!=y[b[i]+l].end()) ans++;

             it++;

         }

         }

     }

     cout<<ans<<endl;

 }