CF1369F.BareLee

Lee is used to finish his stories in a stylish way, this time he barely failed it, but Ice Bear came and helped him. Lee is so grateful for it, so he decided to show Ice Bear his new game called "Critic"...

The game is a one versus one game. It has $t$ rounds, each round has two integers $s_i$ and $e_i$ (which are determined and are known before the game begins, $s_i$ and $e_i$ may differ from round to round). The integer $s_i$ is written on the board at the beginning of the corresponding round.

The players will take turns. Each player will erase the number on the board (let's say it was $a$) and will choose to write either $2 \cdot a$ or $a + 1$ instead. Whoever writes a number strictly greater than $e_i$ loses that round and the other one wins that round.

Now Lee wants to play "Critic" against Ice Bear, for each round he has chosen the round's $s_i$ and $e_i$ in advance. Lee will start the first round, the loser of each round will start the next round.

The winner of the last round is the winner of the game, and the loser of the last round is the loser of the game.

Determine if Lee can be the winner independent of Ice Bear's moves or not. Also, determine if Lee can be the loser independent of Ice Bear's moves or not.

Lee 习惯以一种帅气的方式收尾他的故事，但这次他险些失败，还好 Ice Bear 及时出现并帮了他。Lee 对此感激不尽，于是决定向 Ice Bear 展示他新开发的一款名为“Critic”的游戏……

该游戏为一对一博弈，共进行 $t$ 轮。每轮给定两个整数 $s_i$ 和 $e_i$（这些数值在游戏开始前即已确定且双方均已知；不同轮次的 $s_i$ 和 $e_i$ 可能不同）。在第 $i$ 轮开始时，数字 $s_i$ 被写在黑板上。

两名玩家轮流行动。每次轮到某位玩家时，他需擦去黑板上的当前数字（记为 $a$），然后选择写下 $2 \cdot a$ 或 $a + 1$ 中的一个数。任何一位玩家若写下严格大于 $e_i$ 的数，则该玩家输掉本轮，另一位玩家赢得本轮。

现在 Lee 想要与 Ice Bear 对战“Critic”游戏。对于每一轮，Lee 已预先选定其对应的 $s_i$ 和 $e_i$。第一轮由 Lee 先手；每轮的负方将成为下一轮的先手。

最后一轮的胜者即为整局游戏的胜者，最后一轮的负方即为整局游戏的负方。

请判断：

• Lee 是否无论 Ice Bear 如何应对，都能确保获胜？
• Lee 是否无论 Ice Bear 如何应对，都会落败？

The first line contains the integer $t$ ($1 \le t \le 10^5$) — the number of rounds the game has.

Then $t$ lines follow, each contains two integers $s_i$ and $e_i$ ($1 \le s_i \le e_i \le 10^{18}$) — the $i$-th round's information.

The rounds are played in the same order as given in input, $s_i$ and $e_i$ for all rounds are known to everyone before the game starts.

第一行包含一个整数 $t$（$1 \le t \le 10^5$）—— 表示游戏的轮数。

接下来是 $t$ 行，每行包含两个整数 $s_i$ 和 $e_i$（$1 \le s_i \le e_i \le 10^{18}$）—— 表示第 $i$ 轮的信息。

各轮游戏按输入中给出的顺序进行，且所有轮次的 $s_i$ 和 $e_i$ 在游戏开始前对所有参与者均已知。

Print two integers.

The first one should be 1 if Lee can be the winner independent of Ice Bear's moves, and 0 otherwise.

The second one should be 1 if Lee can be the loser independent of Ice Bear's moves, and 0 otherwise.

输出两个整数。

第一个整数：若无论 Ice Bear 如何行动，Lee 都能获胜，则为 1；否则为 0。

第二个整数：若无论 Ice Bear 如何行动，Lee 都会失败，则为 1；否则为 0。

Remember, whoever writes an integer greater than $e_i$ loses.

注意，任何写下大于 $e_i$ 的整数的人都将输掉游戏。