Problem: On a history lesson the teacher asked Vasya to name the dates when n famous events took place. He doesn't remembers the exact dates but he remembers a segment of days [li, ri] (inclusive) on which the event could have taken place. However Vasya also remembers that there was at most one event in one day. Help him choose such n dates of famous events that will fulfill both conditions. It is guaranteed that it is possible.

Input

The first line contains one integer n (1 ≤ n ≤ 100) — the number of known events. Then follow n lines containing two integers li and ri each (1 ≤ li ≤ ri ≤ 107) — the earliest acceptable date and the latest acceptable date of the i-th event.

Output

Print n numbers — the dates on which the events took place. If there are several solutions, print any of them. It is guaranteed that a solution exists.

Examples

Input

3
1 2
2 3
3 4


Output

1 2 3 


Input

2
1 3
1 3


Output

1 2 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
class keep {
 public:
  int l, r, j;
  bool operator<(const keep &x) { return (l < x.l || (l == x.l && r < x.r)); }
} a[109];
int n, b[109];
void dh(int k, int n) {
  keep t = a[k];
  for (int c; k <= n / 2; k = c) {
    c = k * 2 + 1;
    if ((c <= n && a[c - 1] < a[c]) || c > n) c--;
    if (t < a[c]) break;
    a[k] = a[c];
  }
  a[k] = t;
}
int main() {
  scanf("%d", &n);
  int c = 0, m = n, i;
  for (i = 1; i <= n; i++) {
    scanf("%d %d", &a[i].l, &a[i].r);
    a[i].j = i;
  }
  int h;
  for (i = n; i > 0;) {
    for (h = i / 2; h > 0; h--) dh(h, i);
    c = a[1].l;
    b[a[1].j] = c;
    {
      keep t = a[1];
      a[1] = a[i];
      a[i] = a[1];
    };
    for (h = 1; h < i; h++)
      if (a[h].l == c) a[h].l++;
    i--;
    dh(1, i);
  }
  printf("\n");
  for (i = 1; i <= m; i++) printf("%d ", b[i]);
}