Ddong Game

This game smells so bad you cannot stand to watch it. So you will not play the ddong game yourself; you will have a program play it for you. You start with 1 person. You are given $N$ turns in total, and on each turn two of the following four choices are given. The same choice may be given twice. Each choice is one of $+x, -x, \*x, /x \, (1 \leq x \leq 9)$.

1. If you choose $+x$, the number of people increases by $x$.
2. If you choose $-x$, the number of people decreases by $x$.
3. If you choose $\*x$, the number of people is multiplied by $x$.
4. If you choose $/x$, the number of people is divided by $x$. If the current number of people is not divisible by $x$, the remainder is discarded.

For exactly one of the $N$ choices, you may watch an ad and skip the choice. You may also choose not to watch an ad and not to skip a choice. If, after any turn ends, the current number of people becomes 0 or less, the game is over. You must maximize the number of people after going through the $N$ choices. It is guaranteed that no matter what choices you make, the number of people never exceeds the 32-bit integer range along the way.

The first line gives the number of choices $N \, (1 \leq N \leq 100,000)$.

After that, $N$ lines each give 2 choices separated by a space.

Each choice is one of $+x, -x, \*x, /x$ ($1 \leq x \leq 9$).

Output the maximum number of people after going through the $N$ choices.

If the game is over no matter what choices you make, output ddong game.

In the first example, choosing $+5$ and $\*2$ and skipping the third choice gives the maximum of 12 people.

In the second example, the game is over no matter which choices you pick.