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

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
  
#define ordered_set tree<pair <int, pair <int, int>>, null_type,less<pair <int, pair <int, int>>>, rb_tree_tag,tree_order_statistics_node_update> 
 
const int MAXN = 1e5 + 20, MAXM = 1e2 + 5, MOD = 1e9 + 7;
vector <int> r[MAXN], c[MAXN];

void solve() {
	int n;
	cin >> n;
	
	vector <int> x1, y1;
	vector <pair <int, int>> p(n);
	for (int i = 0; i < n; i++) {
		int x, y;
		cin >> x >> y;
		
		p[i] = make_pair(x, y);
		
		
		r[x].push_back(y);
		c[y].push_back(x);
	
		x1.push_back(x);
		y1.push_back(y);
	}
	
	sort(x1.begin(), x1.end());
	sort(y1.begin(), y1.end());
	
	x1.resize(unique(x1.begin(), x1.end()) - x1.begin());
	y1.resize(unique(y1.begin(), y1.end()) - y1.begin());
	
	for (int i = 0; i < x1.size(); i++) {
		sort(r[x1[i]].begin(), r[x1[i]].end());
	}
	
	for (int i = 0; i < y1.size(); i++) {
		sort(c[y1[i]].begin(), c[y1[i]].end());
	}
	
	long long ans = 0;
	for (int i = 0; i < n; i++) {
		int x = p[i].first;
		int y = p[i].second;
		
		int ind = lower_bound(r[x].begin(), r[x].end(), y) - r[x].begin();
		int ind1 = lower_bound(c[y].begin(), c[y].end(), x) - c[y].begin();

//		cout << x << " " << y << " = " << endl; 
		if (r[x].size() - ind < c[y].size() - ind1) {
			// (x, y), (x, y1), (x + dis, y), (x + dis, y1)
			for (int j = r[x].size() - 1; j > ind; j--) {
				int y1 = r[x][j];
				int dis = y1 - y;
				if (dis <= 0)
					break;
//				cout << " y1 = " << y1;
				
				int hmm = *lower_bound(c[y].begin(), c[y].end(), x + dis);
				if (hmm == x + dis)
					hmm = 1;
				else
					hmm = 0;
					
				int hmmm = *lower_bound(c[y1].begin(), c[y1].end(), x + dis);
				if (hmmm == x + dis)
					hmmm = 1;
				else
					hmmm = 0;
				
				if (hmmm == 1 && hmm == 1) {
//					cout << "check = " << x << " " << y << ", " << x << " " << y1 << ", " << x + dis << " " << y << ", "  << x + dis << " " << y1 << endl; 
					ans++;
				}
			}
		}
		else {
			// (x, y), (x1, y), (x, y + dis), (x1, y + dis)
			for (int j = c[y].size() - 1; j > ind1; j--) {
				int x1 = c[y][j];
				int dis = x1 - x;
				if (dis <= 0)
					break;
//				cout << " x1 = " << x1;
				int hmm = *lower_bound(r[x].begin(), r[x].end(), y + dis);
				if (hmm == y + dis)
					hmm = 1;
				else
					hmm = 0;
					
				int hmmm = *lower_bound(r[x1].begin(), r[x1].end(), y + dis);
				if (hmmm == y + dis)
					hmmm = 1;
				else
					hmmm = 0;

				if (hmm == 1 && hmmm == 1) {
//					cout << "check = " << x << " " << y << ", " << x1 << " " << y << ", " << x << " " << y + dis << ", "  << x1 << " " << y + dis << endl; 
					ans++;
				}
			}
		}
//		cout << endl;
	}
	
	cout << ans << endl;
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int q = 1;
//	cin >> q;
	
	while (q--) {
		solve();
	}
}
