CF45D.Event Dates

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 [l__i, r__i] (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.

在历史课上，老师让瓦西娅说出 n 件著名事件各自发生的日期。他记不清确切的日期，但记得每件事件可能发生的时间段 [l__i, r__i]（含端点）。此外，瓦西娅还记得：每天最多只发生一件事件。请帮他选出 n 个著名事件的发生日期，使其同时满足上述两个条件。题目保证解一定存在。

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

第一行包含一个整数 $n$（$1 \leq n \leq 100$）—— 已知事件的数量。接下来的 $n$ 行，每行包含两个整数 $l_i$ 和 $r_i$（$1 \leq l_i \leq r_i \leq 10^7$）—— 分别表示第 $i$ 个事件的最早可接受日期和最晚可接受日期。

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.

输出 n 个数字——事件发生的日期。若存在多种解，输出任意一种即可。保证解一定存在。