Description

Bessie has invented a new programming language, but since there is no compiler yet, she needs your h

elp to actually run her programs.COWBASIC is a simple, elegant language. It has two key features: ad

dition and MOO loops. Bessie has devised a clever solution to overflow: all addition is done modulo

109+7. But Bessie's real achievement is the MOO loop, which runs a block of code a fixed number of t

imes. MOO loops and addition can, of course, be nested.Given a COWBASIC program, please help Bessie

determine what number it returns.

Format

Input

You are given a COWBASIC program at most 100 lines long, with each line being at most 350 characters

long. A COWBASIC program is a list of statements.

There are three types of statements:

< variable> = < expression>

< literal> MOO {

< list of statements>

}

RETURN < variable>

There are three types of expressions:

< literal>

< variable>

( < expression> ) + ( < expression> )

A literal is a positive integer at most 100,000.

A variable is a string of at most 10 lowercase English letters.

It is guaranteed that no variable will be used or RETURNed before it is defined. It is guaranteed th

at RETURN will happen exactly once, on the last line of the program.

Output

Output a single positive integer, giving the value of the RETURNed variable.

Scoring

In 20 percent of all test cases - MOO loops are not nested.

In another 20 percent of all test cases - The program only has 1 variable. MOO loops can be nested.

In the remaining test cases, there are no further restrictions.

Samples

x = 1
10 MOO {
x = ( x ) + ( x )
}
RETURN x

SAMPLE OUTPUT:

1024

This COWBASIC program computes 210.
SAMPLE INPUT:

n = 1
nsq = 1
100000 MOO {
100000 MOO {
nsq = ( nsq ) + ( ( n ) + ( ( n ) + ( 1 ) ) )
n = ( n ) + ( 1 )
}
}
RETURN nsq

4761
This COWBASIC program computes (10^5+10^5+1)^2 (modulo 10^9+7).