B. Draw!
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You still have partial information about the score during the historic football match. You are given a set of pairs (ai,bi)(ai,bi), indicating that at some point during the match the score was “aiai: bibi”. It is known that if the current score is «xx:yy», then after the goal it will change to “x+1x+1:yy” or “xx:y+1y+1”. What is the largest number of times a draw could appear on the scoreboard?
The pairs “aiai:bibi” are given in chronological order (time increases), but you are given score only for some moments of time. The last pair corresponds to the end of the match.
Input
The first line contains a single integer nn (1≤n≤100001≤n≤10000) — the number of known moments in the match.
Each of the next nn lines contains integers aiai and bibi (0≤ai,bi≤1090≤ai,bi≤109), denot