#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 1e2;
void stndrtn() {}
const bool flag = 0;
struct Segment {
  int l, r, id;
};
void ma1n() {
  int n;
  cin >> n;
  vector<Segment> a(n);
  for (int i = 0; i < n; ++i) {
    Segment& first = a[i];
    cin >> first.l >> first.r, first.id = i;
  }
  sort(a.begin(), a.end(), [&](Segment& first, Segment& second) {
    if (first.r == second.r) {
      return first.l < second.l;
    }
    return first.r < second.r;
  });
  set<int> s;
  vector<int> ans(n);
  for (Segment& first : a) {
    int l = first.l;
    while (s.count(l)) {
      l++;
    }
    s.insert(l);
    ans[first.id] = l;
  }
  for (int first : ans) {
    cout << first << " ";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(nullptr), stndrtn();
  int ts = 1;
  if (flag) {
    cin >> ts;
  }
  while (ts--) {
    ma1n();
  }
  return 0;
}
