Problem G
Trains

You have arrived in Vilnius and want to visit various cities in Lithuania.

Cities in Lithuania are located on a straight line and numbered from $1$ to $N$ sequentially. Vilnius is assigned the number $1$.

Each city has a train station with a single train route that operates from that station. You can only get on a train at the start of its route, though you can get off at any of its stops. Trains starting their route at the $i$-th city make a stop every $d_ i$ cities, and their route consists of $x_ i$ stops (not including the starting city). If $d_ i = 0$, the trains operating from the $i$-th city are currently out of service, so you cannot get on them.

To be more precise, if you get on a train in the $i$-th city, you can get off the train in any city numbered $i + t \cdot d_ i$, where $1 \leq t \leq x_ i$. Note that since you only want to visit cities in Lithuania, you won’t ride further than the $N$-th city, even if the train has more stops on its route.

Task

You are going to visit some cities, using trains to travel between them. As you plan your trip, you start to wonder how many different options you have for your journey that starts at Vilnius. Two journeys are different if they make stops at different sequences of cities.

Calculate this number and print the answer modulo $10^9+7$.

Input

The first line contains one integer $N$ - the number of cities.

Then $N$ lines follow. The $i$-th of them contains two integers $d_ i$ and $x_ i$ – the numbers describing the route starting in the $i$-th city.

Output

Output a single integer - the number of ways you can visit some of the $N$ cities taken modulo $10^9+7$.

Constraints

• $1 \le N \le 10^5$

• $0 \le d_ i \le 10^9$ (for each $1 \leq i \leq N$)

• $0 \le x_ i \le 10^9$ (for each $1 \leq i \leq N$)

Subtasks

Examples

There are $7$ possible journeys you could take:

• $1$

• $1 \rightarrow 2$

• $1 \rightarrow 2 \rightarrow 4$

• $1 \rightarrow 3$

• $1 \rightarrow 3 \rightarrow 4$

• $1 \rightarrow 3 \rightarrow 5$

• $1 \rightarrow 4$

5
1 3
2 1
1 3
0 10
3 5

7