Bessie has invented a new programming language, but since there is no compiler yet, she needs your help to actually run her programs.
COWBASIC is a simple, elegant language. It has two key features: addition and MOO loops. Bessie has devised a clever solution to overflow: all addition is done modulo . But Bessie's real achievement is the MOO loop, which runs a block of code a fixed number of times. MOO loops and addition can, of course, be nested.
Given a COWBASIC program, please help Bessie determine what number it returns.
输入格式
You are given a COWBASIC program at most lines long, with each line being at most 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 that RETURN will happen exactly once, on the last line of the program.
输出格式
Output a single positive integer, giving the value of the RETURNed variable.
样例
样例输入 #1
x = 1
10 MOO {
x = ( x ) + ( x )
}
RETURN x
样例输出 #1
1024
样例输入 #2
n = 1
nsq = 1
100000 MOO {
100000 MOO {
nsq = ( nsq ) + ( ( n ) + ( ( n ) + ( 1 ) ) )
n = ( n ) + ( 1 )
}
}
RETURN nsq
样例输出 #2
4761
数据范围与提示
In percent of all test cases - MOO loops are not nested.
In another percent of all test cases - The program only has variable. MOO loops can be nested.
In the remaining test cases, there are no further restrictions.
