#include <bits/stdc++.h>
using namespace std;
const long long maxn = 105;
long long n, ans[maxn];
struct seg {
  long long l, r, andis;
};
struct cmp {
  bool operator()(seg a, seg b) {
    return (a.l < b.l || (a.l == b.l && a.r < b.r) ||
            (a.l == b.l && a.r == b.r && a.andis < b.andis));
  }
};
set<seg, cmp> s;
seg first, second;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> first.l >> first.r;
    first.andis = i;
    s.insert(first);
  }
  while (s.size()) {
    first = *(s.begin());
    s.erase(first);
    ans[first.andis] = first.l;
    while (1) {
      second = *(s.begin());
      if (second.l == first.l) {
        s.erase(second);
        second.l++;
        s.insert(second);
      } else {
        break;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    cout << ans[i] << " ";
  }
  cout << endl;
  return 0;
}
