#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void rset();
void init_test();
void solve();
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed;
  cout.precision(20);
  init_test();
  return 0;
}
template <typename T>
void chmin(T& a, T b) {
  if (a > b) a = b;
}
template <typename T>
void chmax(T& a, T b) {
  if (a < b) a = b;
}
template <typename T>
void MACRO_rdv2_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_rdv2_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_rdv2_Init(n, rest...);
}
template <typename T>
void MACRO_rdv2_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_rdv2_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_rdv2_Scan(p, rest...);
}
template <typename T>
void wrv(const vector<T>& v) {
  for (int(__ii) = (0); (__ii) < (((int)v.size())); ++(__ii)) {
    if (__ii) cout << ' ';
    cout << v[__ii];
  }
  cout << '\n';
}
template <typename T>
void wrm(const vector<vector<T>>& v) {
  for (int(__ii) = (0); (__ii) < (((int)v.size())); ++(__ii)) {
    for (int(__jj) = (0); (__jj) < (v[__ii].size()); ++(__jj)) {
      if (__jj) cout << ' ';
      cout << v[__ii][__jj];
    }
    cout << '\n';
  }
}
template <typename T>
void sc(T& x) {
  cin >> x;
}
template <typename Head, typename... Tail>
void sc(Head& head, Tail&... tail) {
  cin >> head;
  sc(tail...);
}
template <typename T>
void wr(const T& x) {
  cout << x << '\n';
}
template <typename Head, typename... Tail>
void wr(const Head& head, const Tail&... tail) {
  cout << head << ' ';
  wr(tail...);
}
template <typename T>
void wrf(const T& x) {
  cout << x << endl;
}
template <typename Head, typename... Tail>
void wrf(const Head& head, const Tail&... tail) {
  cout << head << ' ';
  wrf(tail...);
}
template <typename T>
void debug_out(const T& x) {
  cerr << x << '\n';
}
template <typename Head, typename... Tail>
void debug_out(const Head& head, const Tail&... tail) {
  cerr << head << ' ';
  debug_out(tail...);
}
template <typename... T>
void err(const T&... cod) {
  wr(cod...);
  exit(0);
}
void compress(vector<pair<int, int>>& a) {
  int n = ((int)a.size());
  vector<int> t;
  for (int(i) = (0); (i) < (n); ++(i)) {
    t.push_back(a[i].first);
    t.push_back(a[i].second);
  }
  sort(t.begin(), t.end());
  map<int, int> to;
  for (int(i) = (0); (i) < (2 * n); ++(i)) to[t[i]] = i;
  for (int(i) = (0); (i) < (n); ++(i)) {
    a[i].first = to[a[i].first];
    a[i].second = to[a[i].second];
  }
}
struct fentree {
  vector<int> bit;
  int n;
  fentree(int n) {
    this->n = n;
    bit.assign(n, 0);
  }
  int sum(int r) {
    if (r < 0) return 0;
    int ret = 0;
    for (; r >= 0; r = (r & (r + 1)) - 1) ret += bit[r];
    return ret;
  }
  void add(int idx, int delta) {
    if (idx < 0) return;
    for (; idx < n; idx = idx | (idx + 1)) bit[idx] += delta;
  }
};
void solve() {
  int n;
  sc(n);
  vector<pair<int, int>> a(n);
  for (int(i) = (0); (i) < (n); ++(i)) cin >> a[i].first >> a[i].second;
  compress(a);
  map<int, int> r, id, ans;
  vector<int> order;
  for (int(i) = (0); (i) < (n); ++(i)) {
    r[a[i].first] = a[i].second;
    id[a[i].first] = i;
    order.push_back(a[i].first);
  }
  sort(order.begin(), order.end());
  fentree ft(2 * n);
  for (int(i) = (n - 1); (i) >= (0); --(i)) {
    int x = order[i];
    ans[id[x]] = ft.sum(r[x]);
    ft.add(r[x], 1);
  }
  for (auto p : ans) wr(p.second);
}
void init_test() {
  int qq = 1;
  while (qq--) solve();
}
