#include <bits/stdc++.h>
#define fi first
#define se second
#define mp(x, y) make_pair(x, y)
typedef long long ll;
using namespace std;



int main() {
	int n;
	cin >> n;
	vector<pair<pair<int, int>, int>> a(n + 1);
	for (int i = 1; i <= n; ++i) {
		int s, t;
		cin >> s >> t;
		a[i] = mp(mp(s, t), i);
	}
	sort(a.begin() + 1, a.end(), [](pair<pair<int, int>, int> x, pair<pair<int, int>, int> y) {
		return x.fi.fi == y.fi.fi ? x.fi.se > y.fi.se : x.fi.fi < y.fi.fi;
	});

	vector<int> c;
	for (int i = 1; i <= n; ++i) 
		c.push_back(a[i].fi.se);
	sort(c.begin(), c.end());
	c.erase(unique(c.begin(), c.end()), c.end());
	int m = c.size();
	vector<int> d(m + 1);

	auto ask = [&](int pos) {
		pos = m - pos + 1;
		int ret = 0;
		for (; pos; pos -= (pos & -pos))
			ret = max(ret, d[pos]);
		return ret;
	};
	auto mod = [&](int pos, int val) {
		pos = m - pos + 1;
		for (; pos <= m; pos += (pos & -pos))
			d[pos] = max(d[pos], val);
	};

	vector<int> ans(n + 1);
	for (int i = 1; i <= n; ++i) {
		int r = lower_bound(c.begin(), c.end(), a[i].fi.se) - c.begin() + 1;
		ans[a[i].se] = ask(r) + 1;
		mod(r, ans[a[i].se]);
	}
	for (int i = 1; i <= n; ++i)
		cout << ans[i] - 1 << ' ';
	cout << endl;
}