Source

This problem is adapted from Long Long OJ and proposed by . All rights reserved.

Problem Background

yangrenruiYRR was bored and created a new programming language.

Problem Description

The input provides a series of statements of the following types ($x$ is a variable name consisting of a lowercase letter, and $y$ is an integer):

• define x y, sets $x$ to $y$;
• plus x y, changes $x$ to $x + y$;
• minus x y, changes $x$ to $x - y$;
• times x y, changes $x$ to $x \times y$;
• divide x y, changes $x$ to $\dfrac{x}{y}$;
• out x, outputs $x$.

The initial value of all variables is $0$.

Input Format

• Line $1$: A positive integer $n$;
• Lines $2$ to $n + 1$: One statement per line.

Output Format

The output of the program defined by the input.

Samples

4
define a 31415
define b 92653
out a
out b

31415
92653

Data Range

Special Properties:

• A: Only one variable appears;
• B: Only define and out operations are used;
• C: All variable values during computation are $\ge 0$ and $y \ge 0$.

For $100\%$ of the data, $1 \le n \le 10^6$, $-2^{31} \le y < 2^{31}$.

You only need to use int for calculations.