#include <bits/stdc++.h>
using namespace std;
struct node {
  int l, r;
  int id;
};
int n;
node f[105];
int m[105];
int main() {
  priority_queue<pair<pair<int, int>, int> > q;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &f[i].l, &f[i].r);
    q.push(make_pair(make_pair(f[i].r, f[i].l), i));
  }
  int right = 1e7;
  while (!q.empty()) {
    while (right < q.top().first.first) {
      pair<pair<int, int>, int> t = q.top();
      q.pop();
      t.first.first = right;
      q.push(t);
      if (q.top().first.first < q.top().first.second) f[n + 123123].l = 1;
    }
    int id = q.top().second;
    m[id] = q.top().first.first;
    right = q.top().first.first - 1;
    q.pop();
  }
  for (int i = 0; i < n; i++) {
    if (i > 0) printf(" ");
    printf("%d", m[i]);
  }
  printf("\n");
  return 0;
}
