Cafebazaar's Chess Tournament

Ali hosts a yearly chess tournament for CafeBazaar's Shab-e Yalda festival. In a chess tournament, each pair of participants play a game against each other exactly once. Players earn one point for a win, half a point for a draw, and no points for a loss toward their tournament score.

Danial has built a system to predict the result of Ali's tournament. Based on experience, he has assigned an opening skill and an ending skill to each of the n participants. For the i-th participant, let us denote the former with $o_i$ and the latter with $e_i$. In a game between the i-th and j-th participants, Danial decides the result of the game according to the following rules.

1. If $o_i > o_j$ and $e_i > e_j$, then the i-th participant wins the game.
2. If $o_j > o_i$ and $e_j > e_i$, then the j-th participant wins the game.
3. Otherwise, the game ends in a draw.

To make the tournament more exciting, Ali wants to invite Danial to join the other n participants in the tournament. Danial has no prior experience in chess, so he decides to practice for the tournament. Based on the amount of training, Danial can end up with any opening and ending skill. However, Danial has promised Ali that he will train so that his opening skill is different from the opening skill of the other participants. He will also keep his ending skill different from the ending skill of the other participants.

For his advertisement campaign, Ali wants to know the number of distinct possible final scores that Danial might get based on the rules above. For example, Danial can achieve the scores 0, 1.5, 2.5, 3, 4, and 5 in the sample. The score 3, for instance, is obtained by setting both Danial's opening and ending skills to 1.5. Since Ali and all other CafeBazaar programmers are busy planning the event, he has turned to you for help. Write a program to calculate this value.

The first line of the input contains a single integer $n$, the number of participants. ($1 \le n \le 200\,000$)

The i-th of the next $n$ lines contains two integers $o_i$ and $e_i$, the opening and ending skills of the i-th participant, respectively. ($1 \le o_i, e_i \le n$)

The limits for opening and ending skills do not apply to Danial's opening and ending skills. More specifically, Danial's opening and ending skills can be any real numbers.

In the only line of the output, print the number of distinct possible final scores for Danial.