Compressed Formula

You are given a long but simple formula in a compressed format. A compressed formula is a sequence of $N$ pairs of an integer $r_i$ and a string $s_i$, where each $s_i$ consists only of the digits 0 to 9 and the characters +, -, *. To restore the original formula, repeat $s_i$ exactly $r_i$ times for every $i$, then concatenate the resulting strings in the order of the sequence.

A restored formula always satisfies the following BNF.

<expression> := <term> | <expression> '+' <term> | <expression> '-' <term>
<term> := <number> | <term> '*' <number>
<number> := <digit> | <non-zero-digit> <number>
<digit> := '0' | <non-zero-digit>
<non-zero-digit> := '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9'

Here + means addition, - means subtraction, and * means multiplication of integers.

Write a program that computes the value of the given formula modulo 1,000,000,007. Here $x$ modulo $m$ is the non-negative integer $r$ such that some integer $k$ satisfies $x = km + r$ and $0 \le r < m$. For integers $x$ and $m$, that $r$ is uniquely determined.

The input consists of a single test case.

N
r1 s1
...
rN sN

The first line contains the length $N$ ($1 \le N \le 10^4$) of the compressed formula. Each of the following $N$ lines holds one piece of the compressed formula. The $i$-th line contains an integer $r_i$ ($1 \le r_i \le 10^9$) and a string $s_i$ ($1 \le |s_i| \le 10$), where $r_i$ is the number of repetitions of $s_i$ and $s_i$ is a piece of the original formula. The formula restored by repeating and concatenating the pieces satisfies the BNF above.

Print the value of the given compressed formula modulo 1,000,000,007.