A three-person summit push team radios altitude-gain readings back to basecamp during their final ascent. Each radio call is logged in order and is either a plain number or one of three relay codes that basecamp uses to keep the log honest over a noisy channel:

• A bare integer v records a fresh altitude-gain reading of v metres.
• RELAY records a reading equal to the sum of the two most recently logged valid readings (the log is guaranteed to hold at least two valid readings by the time a RELAY call arrives).
• DOUBLE records a reading equal to twice the most recently logged valid reading (the log is guaranteed to hold at least one valid reading by the time a DOUBLE call arrives).
• SCRATCH erases the most recently logged valid reading entirely, as if it had never been radioed in (the log is guaranteed to hold at least one valid reading by the time a SCRATCH call arrives).

After the whole log has been processed, basecamp wants the sum of every reading still standing in the log. Compute that total.

Input format

The first line contains a single integer n (1 <= n <= 1000), the number of radio calls. Each of the next n lines contains one call: either an integer v (-310^4 <= v <= 310^4), or one of the strings RELAY, DOUBLE, SCRATCH. The calls are guaranteed to be valid in the sense described above.

Output format

Print a single integer: the sum of all readings remaining in the log after every call has been processed.

Constraints

• 1 <= n <= 1000
• Every plain reading v satisfies -310^4 <= v <= 310^4.
• The final answer fits in a 64-bit signed integer.

5
5
2
SCRATCH
DOUBLE
RELAY

30

8
5
-2
4
SCRATCH
DOUBLE
9
RELAY
RELAY

27